/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithDepranks-Lazy-wrwc.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/fib_safe-6.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-820ea7a [2022-02-19 17:07:14,434 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-19 17:07:14,436 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-19 17:07:14,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-19 17:07:14,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-19 17:07:14,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-19 17:07:14,493 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-19 17:07:14,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-19 17:07:14,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-19 17:07:14,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-19 17:07:14,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-19 17:07:14,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-19 17:07:14,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-19 17:07:14,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-19 17:07:14,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-19 17:07:14,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-19 17:07:14,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-19 17:07:14,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-19 17:07:14,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-19 17:07:14,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-19 17:07:14,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-19 17:07:14,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-19 17:07:14,510 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-19 17:07:14,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-19 17:07:14,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-19 17:07:14,513 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-19 17:07:14,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-19 17:07:14,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-19 17:07:14,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-19 17:07:14,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-19 17:07:14,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-19 17:07:14,515 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-19 17:07:14,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-19 17:07:14,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-19 17:07:14,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-19 17:07:14,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-19 17:07:14,518 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-19 17:07:14,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-19 17:07:14,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-19 17:07:14,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-19 17:07:14,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-19 17:07:14,520 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithDepranks-Lazy-wrwc.epf [2022-02-19 17:07:14,534 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-19 17:07:14,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-19 17:07:14,534 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-19 17:07:14,535 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-19 17:07:14,535 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-19 17:07:14,535 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-19 17:07:14,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-19 17:07:14,536 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-19 17:07:14,536 INFO L138 SettingsManager]: * Use SBE=true [2022-02-19 17:07:14,536 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-19 17:07:14,536 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-19 17:07:14,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-19 17:07:14,536 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-19 17:07:14,536 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-19 17:07:14,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-19 17:07:14,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-19 17:07:14,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-19 17:07:14,537 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-19 17:07:14,537 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-19 17:07:14,537 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-19 17:07:14,537 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-19 17:07:14,537 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-19 17:07:14,538 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-19 17:07:14,538 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-19 17:07:14,538 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-19 17:07:14,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-19 17:07:14,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-19 17:07:14,538 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-02-19 17:07:14,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-19 17:07:14,538 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-19 17:07:14,539 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-19 17:07:14,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-19 17:07:14,539 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-19 17:07:14,539 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-02-19 17:07:14,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-19 17:07:14,539 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITH_DEPRANKS [2022-02-19 17:07:14,539 INFO L138 SettingsManager]: * MCR: Overapproximate write-read-write conflicts=false [2022-02-19 17:07:14,539 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-02-19 17:07:14,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-19 17:07:14,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-19 17:07:14,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-19 17:07:14,761 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-19 17:07:14,762 INFO L275 PluginConnector]: CDTParser initialized [2022-02-19 17:07:14,763 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_safe-6.i [2022-02-19 17:07:14,809 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e9d922c/addede2b64854640bac4c9e7083a0827/FLAGc73625d14 [2022-02-19 17:07:15,253 INFO L306 CDTParser]: Found 1 translation units. [2022-02-19 17:07:15,253 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-6.i [2022-02-19 17:07:15,260 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e9d922c/addede2b64854640bac4c9e7083a0827/FLAGc73625d14 [2022-02-19 17:07:15,268 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e9d922c/addede2b64854640bac4c9e7083a0827 [2022-02-19 17:07:15,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-19 17:07:15,271 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-19 17:07:15,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-19 17:07:15,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-19 17:07:15,274 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-19 17:07:15,274 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 05:07:15" (1/1) ... [2022-02-19 17:07:15,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2805e299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:15, skipping insertion in model container [2022-02-19 17:07:15,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 05:07:15" (1/1) ... [2022-02-19 17:07:15,280 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-19 17:07:15,306 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-19 17:07:15,648 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-6.i[30813,30826] [2022-02-19 17:07:15,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-19 17:07:15,659 INFO L203 MainTranslator]: Completed pre-run [2022-02-19 17:07:15,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-6.i[30813,30826] [2022-02-19 17:07:15,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-19 17:07:15,705 INFO L208 MainTranslator]: Completed translation [2022-02-19 17:07:15,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:15 WrapperNode [2022-02-19 17:07:15,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-19 17:07:15,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-19 17:07:15,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-19 17:07:15,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-19 17:07:15,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:15" (1/1) ... [2022-02-19 17:07:15,718 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:15" (1/1) ... [2022-02-19 17:07:15,731 INFO L137 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2022-02-19 17:07:15,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-19 17:07:15,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-19 17:07:15,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-19 17:07:15,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-19 17:07:15,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:15" (1/1) ... [2022-02-19 17:07:15,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:15" (1/1) ... [2022-02-19 17:07:15,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:15" (1/1) ... [2022-02-19 17:07:15,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:15" (1/1) ... [2022-02-19 17:07:15,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:15" (1/1) ... [2022-02-19 17:07:15,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:15" (1/1) ... [2022-02-19 17:07:15,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:15" (1/1) ... [2022-02-19 17:07:15,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-19 17:07:15,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-19 17:07:15,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-19 17:07:15,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-19 17:07:15,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:15" (1/1) ... [2022-02-19 17:07:15,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-19 17:07:15,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:07:15,788 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-19 17:07:15,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-19 17:07:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-02-19 17:07:15,833 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-02-19 17:07:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-02-19 17:07:15,834 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-02-19 17:07:15,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-19 17:07:15,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-19 17:07:15,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-19 17:07:15,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-19 17:07:15,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-19 17:07:15,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-19 17:07:15,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-19 17:07:15,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-19 17:07:15,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-19 17:07:15,835 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-19 17:07:15,908 INFO L234 CfgBuilder]: Building ICFG [2022-02-19 17:07:15,909 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-19 17:07:16,074 INFO L275 CfgBuilder]: Performing block encoding [2022-02-19 17:07:16,078 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-19 17:07:16,078 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-19 17:07:16,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 05:07:16 BoogieIcfgContainer [2022-02-19 17:07:16,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-19 17:07:16,081 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-19 17:07:16,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-19 17:07:16,083 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-19 17:07:16,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 05:07:15" (1/3) ... [2022-02-19 17:07:16,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51411be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 05:07:16, skipping insertion in model container [2022-02-19 17:07:16,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:15" (2/3) ... [2022-02-19 17:07:16,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51411be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 05:07:16, skipping insertion in model container [2022-02-19 17:07:16,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 05:07:16" (3/3) ... [2022-02-19 17:07:16,085 INFO L111 eAbstractionObserver]: Analyzing ICFG fib_safe-6.i [2022-02-19 17:07:16,088 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-19 17:07:16,088 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-19 17:07:16,088 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-19 17:07:16,088 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-19 17:07:16,120 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,120 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,120 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,120 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,120 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,120 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,121 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,121 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,121 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,121 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,121 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,122 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,122 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,122 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,122 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,122 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,122 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,122 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,123 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,123 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,123 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,123 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,123 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,123 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,123 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,123 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,124 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,124 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,124 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,124 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,124 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,124 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,125 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,125 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,125 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,125 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,127 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,127 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,127 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,128 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,128 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,129 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,129 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,129 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,129 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,130 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,130 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-19 17:07:16,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-19 17:07:16,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:07:16,165 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-02-19 17:07:16,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-02-19 17:07:16,198 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-19 17:07:16,204 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mLazyFiniteAutomaton=true, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=false [2022-02-19 17:07:16,204 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-19 17:07:16,257 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 91 transitions and produced 92 states. [2022-02-19 17:07:16,258 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-19 17:07:16,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:07:16,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1927097680, now seen corresponding path program 1 times [2022-02-19 17:07:16,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:07:16,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487724227] [2022-02-19 17:07:16,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:07:16,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:07:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:07:16,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:07:16,398 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:07:16,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487724227] [2022-02-19 17:07:16,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487724227] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 17:07:16,399 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 17:07:16,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-19 17:07:16,400 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200546851] [2022-02-19 17:07:16,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 17:07:16,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-19 17:07:16,404 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:07:16,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-19 17:07:16,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-19 17:07:16,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:16,419 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:07:16,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-19 17:07:16,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:16,445 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 91 transitions and produced 92 states. [2022-02-19 17:07:16,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:16,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-19 17:07:16,447 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-19 17:07:16,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:07:16,447 INFO L85 PathProgramCache]: Analyzing trace with hash 560415153, now seen corresponding path program 1 times [2022-02-19 17:07:16,447 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:07:16,448 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131971424] [2022-02-19 17:07:16,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:07:16,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:07:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:07:16,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:07:16,504 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:07:16,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131971424] [2022-02-19 17:07:16,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131971424] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 17:07:16,505 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 17:07:16,505 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-19 17:07:16,505 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131994307] [2022-02-19 17:07:16,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 17:07:16,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-19 17:07:16,506 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:07:16,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-19 17:07:16,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-19 17:07:16,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:16,507 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:07:16,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-19 17:07:16,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:16,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:16,541 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 114 transitions and produced 115 states. [2022-02-19 17:07:16,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:16,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:07:16,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-19 17:07:16,542 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-19 17:07:16,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:07:16,543 INFO L85 PathProgramCache]: Analyzing trace with hash -951035470, now seen corresponding path program 1 times [2022-02-19 17:07:16,543 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:07:16,543 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975412660] [2022-02-19 17:07:16,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:07:16,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:07:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:07:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:07:16,638 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:07:16,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975412660] [2022-02-19 17:07:16,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975412660] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 17:07:16,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140907388] [2022-02-19 17:07:16,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:07:16,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:07:16,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:07:16,644 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-19 17:07:16,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-19 17:07:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:07:16,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-19 17:07:16,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 17:07:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:07:16,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 17:07:17,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:07:17,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140907388] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 17:07:17,089 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 17:07:17,090 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-19 17:07:17,090 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032772330] [2022-02-19 17:07:17,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 17:07:17,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-19 17:07:17,092 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:07:17,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-19 17:07:17,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-19 17:07:17,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:17,094 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:07:17,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-19 17:07:17,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:17,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:07:17,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:17,390 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 160 transitions and produced 161 states. [2022-02-19 17:07:17,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:17,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:07:17,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:07:17,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-19 17:07:17,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-19 17:07:17,604 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-19 17:07:17,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:07:17,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1666707666, now seen corresponding path program 2 times [2022-02-19 17:07:17,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:07:17,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287164195] [2022-02-19 17:07:17,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:07:17,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:07:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:07:17,705 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:07:17,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:07:17,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287164195] [2022-02-19 17:07:17,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287164195] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 17:07:17,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187316142] [2022-02-19 17:07:17,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-19 17:07:17,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:07:17,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:07:17,720 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-19 17:07:17,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-19 17:07:17,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-19 17:07:17,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-19 17:07:17,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-19 17:07:17,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 17:07:17,930 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:07:17,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 17:07:18,088 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:07:18,088 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187316142] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 17:07:18,088 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 17:07:18,089 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-02-19 17:07:18,089 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414762400] [2022-02-19 17:07:18,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 17:07:18,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-19 17:07:18,089 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:07:18,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-19 17:07:18,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-02-19 17:07:18,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:18,090 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:07:18,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-19 17:07:18,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:18,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:07:18,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:07:18,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:18,443 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 252 transitions and produced 249 states. [2022-02-19 17:07:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:07:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:07:18,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-19 17:07:18,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-19 17:07:18,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:07:18,660 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-19 17:07:18,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:07:18,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1283180782, now seen corresponding path program 3 times [2022-02-19 17:07:18,661 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:07:18,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383758816] [2022-02-19 17:07:18,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:07:18,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:07:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:07:18,803 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:07:18,804 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:07:18,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383758816] [2022-02-19 17:07:18,804 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383758816] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 17:07:18,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265644989] [2022-02-19 17:07:18,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-19 17:07:18,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:07:18,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:07:18,810 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-19 17:07:18,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-19 17:07:18,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-02-19 17:07:18,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-19 17:07:18,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-19 17:07:18,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 17:07:19,025 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:07:19,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 17:07:19,270 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:07:19,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265644989] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 17:07:19,270 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 17:07:19,270 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 31 [2022-02-19 17:07:19,271 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856695788] [2022-02-19 17:07:19,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 17:07:19,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-02-19 17:07:19,272 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:07:19,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-02-19 17:07:19,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2022-02-19 17:07:19,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:19,274 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:07:19,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.935483870967742) internal successors, (153), 31 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-19 17:07:19,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:19,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:07:19,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:07:19,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-19 17:07:19,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:19,991 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 413 transitions and produced 397 states. [2022-02-19 17:07:19,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:19,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:07:19,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:07:19,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-19 17:07:19,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-02-19 17:07:20,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-19 17:07:20,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:07:20,209 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-19 17:07:20,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:07:20,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2049692625, now seen corresponding path program 4 times [2022-02-19 17:07:20,210 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:07:20,210 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119560843] [2022-02-19 17:07:20,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:07:20,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:07:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:07:21,566 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:07:21,566 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:07:21,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119560843] [2022-02-19 17:07:21,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119560843] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 17:07:21,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972190672] [2022-02-19 17:07:21,567 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-19 17:07:21,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:07:21,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:07:21,569 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-19 17:07:21,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-19 17:07:21,665 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-19 17:07:21,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-19 17:07:21,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 47 conjunts are in the unsatisfiable core [2022-02-19 17:07:21,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 17:07:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 486 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:07:24,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 17:17:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 649 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:17:08,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972190672] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 17:17:08,022 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 17:17:08,022 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 139 [2022-02-19 17:17:08,022 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682207582] [2022-02-19 17:17:08,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 17:17:08,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 139 states [2022-02-19 17:17:08,024 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:17:08,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2022-02-19 17:17:08,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1240, Invalid=17785, Unknown=157, NotChecked=0, Total=19182 [2022-02-19 17:17:08,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:17:08,030 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:17:08,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 139 states, 139 states have (on average 3.050359712230216) internal successors, (424), 139 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-19 17:17:08,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:17:08,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:17:08,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:17:08,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-19 17:17:08,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-02-19 17:17:08,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:19:42,425 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse21 (* (- 1) c_~j~0)) (.cse11 (* (- 1) c_~i~0)) (.cse23 (* 2 c_~cur~0))) (let ((.cse0 (+ c_~prev~0 c_~cur~0)) (.cse3 (+ .cse23 c_~prev~0)) (.cse6 (div (+ (- 2) .cse11 c_~cur~0) (- 2))) (.cse5 (+ c_~next~0 1)) (.cse1 (+ c_~prev~0 c_~next~0)) (.cse4 (div (+ (- 2) .cse21 c_~cur~0) (- 2))) (.cse7 (+ c_~prev~0 1 c_~cur~0)) (.cse20 (+ (* 2 c_~next~0) 4 c_~cur~0)) (.cse12 (+ .cse23 3 c_~prev~0)) (.cse17 (+ 2 c_~next~0 c_~cur~0)) (.cse15 (+ c_~next~0 c_~cur~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) (<= .cse4 .cse5) (<= c_~i~0 c_~next~0) (<= .cse6 .cse7) (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 ((.cse8 (* 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) (+ .cse8 (* 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 (+ .cse8 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 ((.cse9 (* 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) (+ .cse9 (* 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 (+ .cse9 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 ((.cse10 (* 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 (+ .cse10 1 c_~cur~0)) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse10 (* 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 .cse11 (- 6) c_~cur~0) (- 2)) .cse12) (<= c_~j~0 c_~cur~0) (forall ((v_~cur~0_28 Int) (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 ((.cse13 (* 2 v_~cur~0_26))) (or (< aux_div_v_~cur~0_22_51 (+ .cse13 c_~prev~0 v_~cur~0_28 1 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (< v_~cur~0_28 (+ (* 2 c_~cur~0) c_~prev~0)) (>= aux_mod_v_~next~0_20_56 2) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 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) v_~cur~0_28 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))) (> 0 aux_mod_v_~cur~0_22_51) (< v_~prev~0_24 (+ c_~prev~0 v_~cur~0_28 v_~cur~0_26 c_~cur~0)) (< v_~cur~0_26 (+ c_~prev~0 (* 2 v_~cur~0_28) 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 ((.cse14 (* 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 (+ .cse14 c_~prev~0 1)) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse14 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56))) (> 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_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))) (<= c_~j~0 .cse15) (forall ((v_~cur~0_28 Int) (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 ((.cse16 (* 2 v_~cur~0_26))) (or (< aux_div_v_~cur~0_22_51 (+ .cse16 c_~prev~0 v_~cur~0_28 1 c_~cur~0)) (< (+ 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) v_~cur~0_28 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (< v_~cur~0_28 (+ (* 2 c_~cur~0) c_~prev~0)) (>= aux_mod_v_~next~0_20_56 2) (> 0 aux_mod_v_~cur~0_22_51) (< v_~prev~0_24 (+ c_~prev~0 v_~cur~0_28 v_~cur~0_26 c_~cur~0)) (< v_~cur~0_26 (+ c_~prev~0 (* 2 v_~cur~0_28) 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)))))) (<= c_~j~0 .cse0) (<= c_~i~0 .cse3) (<= .cse6 .cse5) (<= (div (+ .cse11 (- 4) c_~next~0) (- 2)) .cse17) (<= 0 c_~prev~0) (forall ((v_~cur~0_28 Int)) (or (< v_~cur~0_28 (+ c_~prev~0 c_~cur~0)) (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 ((.cse18 (* 2 v_~cur~0_26))) (or (< v_~prev~0_24 (+ v_~cur~0_28 v_~cur~0_26 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (< aux_div_v_~cur~0_22_51 (+ .cse18 v_~cur~0_28 1 c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (> 0 aux_mod_v_~cur~0_22_51) (< v_~cur~0_26 (+ (* 2 v_~cur~0_28) c_~cur~0)) (< (+ 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) (* 2 aux_div_v_~next~0_20_56) v_~cur~0_28 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)))))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse19 (* 2 v_~cur~0_26))) (or (< v_~prev~0_24 (+ v_~cur~0_28 v_~cur~0_26 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (< aux_div_v_~cur~0_22_51 (+ .cse19 v_~cur~0_28 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) (< v_~cur~0_26 (+ (* 2 v_~cur~0_28) c_~cur~0)) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse19 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) (* 2 aux_div_v_~next~0_20_56) v_~cur~0_28 c_~cur~0)) (> 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))) (<= (div (+ .cse11 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|) (<= .cse4 .cse7) (<= c_~j~0 |c_ULTIMATE.start_fib_#res#1|) (<= (div (+ .cse21 c_~next~0 (- 8) c_~cur~0) (- 2)) .cse20) (<= 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 ((.cse22 (* 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) (+ .cse22 (* 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 (+ .cse22 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 .cse21 (- 6) c_~cur~0) (- 2)) .cse12) (<= (div (+ .cse21 (- 4) c_~next~0) (- 2)) .cse17) (<= c_~i~0 1) (<= c_~i~0 .cse15) (<= 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-02-19 17:19:42,599 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 460 transitions and produced 427 states. [2022-02-19 17:19:42,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:19:42,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:19:42,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:19:42,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-19 17:19:42,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-02-19 17:19:42,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-02-19 17:19:42,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-19 17:19:42,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:19:42,816 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-19 17:19:42,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:19:42,817 INFO L85 PathProgramCache]: Analyzing trace with hash -77689536, now seen corresponding path program 1 times [2022-02-19 17:19:42,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:19:42,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076730311] [2022-02-19 17:19:42,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:19:42,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:19:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:19:42,875 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 653 trivial. 0 not checked. [2022-02-19 17:19:42,875 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:19:42,875 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076730311] [2022-02-19 17:19:42,875 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076730311] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 17:19:42,875 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 17:19:42,875 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-19 17:19:42,876 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985425092] [2022-02-19 17:19:42,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 17:19:42,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-19 17:19:42,876 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:19:42,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-19 17:19:42,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-19 17:19:42,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:19:42,877 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:19:42,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-19 17:19:42,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:19:42,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:19:42,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:19:42,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-19 17:19:42,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-02-19 17:19:42,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-02-19 17:19:42,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:19:46,736 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse23 (* (- 1) c_~j~0)) (.cse13 (* (- 1) c_~i~0)) (.cse25 (* 2 c_~cur~0))) (let ((.cse2 (+ c_~prev~0 c_~cur~0)) (.cse5 (+ .cse25 c_~prev~0)) (.cse8 (div (+ (- 2) .cse13 c_~cur~0) (- 2))) (.cse7 (+ c_~next~0 1)) (.cse3 (+ c_~prev~0 c_~next~0)) (.cse6 (div (+ (- 2) .cse23 c_~cur~0) (- 2))) (.cse9 (+ c_~prev~0 1 c_~cur~0)) (.cse22 (+ (* 2 c_~next~0) 4 c_~cur~0)) (.cse14 (+ .cse25 3 c_~prev~0)) (.cse19 (+ 2 c_~next~0 c_~cur~0)) (.cse17 (+ c_~next~0 c_~cur~0))) (and (forall ((v_~j~0_8 Int)) (or (and (forall ((v_~cur~0_28 Int) (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_div_v_~cur~0_22_51 (+ .cse0 c_~prev~0 v_~cur~0_28 1 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (< (+ 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) v_~cur~0_28 c_~cur~0)) (< v_~cur~0_28 (+ (* 2 c_~cur~0) c_~prev~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 v_~j~0_8) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< v_~prev~0_24 (+ c_~prev~0 v_~cur~0_28 v_~cur~0_26 c_~cur~0)) (< v_~cur~0_26 (+ c_~prev~0 (* 2 v_~cur~0_28) c_~cur~0)) (> 0 aux_mod_v_~next~0_20_56)))) (forall ((v_~cur~0_28 Int) (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_div_v_~cur~0_22_51 (+ .cse1 c_~prev~0 v_~cur~0_28 1 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (< v_~cur~0_28 (+ (* 2 c_~cur~0) c_~prev~0)) (>= aux_mod_v_~next~0_20_56 2) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 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) v_~cur~0_28 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))) (> 0 aux_mod_v_~cur~0_22_51) (< v_~prev~0_24 (+ c_~prev~0 v_~cur~0_28 v_~cur~0_26 c_~cur~0)) (< v_~cur~0_26 (+ c_~prev~0 (* 2 v_~cur~0_28) c_~cur~0)) (> 0 aux_mod_v_~next~0_20_56))))) (not (<= v_~j~0_8 1)))) (<= 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) (<= .cse6 .cse7) (<= c_~i~0 c_~next~0) (<= .cse8 .cse9) (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 ((.cse10 (* 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) (+ .cse10 (* 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 (+ .cse10 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 ((.cse11 (* 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) (+ .cse11 (* 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 (+ .cse11 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 ((.cse12 (* 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 (+ .cse12 1 c_~cur~0)) (< (+ aux_mod_v_~next~0_20_56 c_~j~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)) (> 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 .cse13 (- 6) c_~cur~0) (- 2)) .cse14) (<= c_~j~0 c_~cur~0) (forall ((v_~cur~0_28 Int) (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 ((.cse15 (* 2 v_~cur~0_26))) (or (< aux_div_v_~cur~0_22_51 (+ .cse15 c_~prev~0 v_~cur~0_28 1 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (< v_~cur~0_28 (+ (* 2 c_~cur~0) c_~prev~0)) (>= aux_mod_v_~next~0_20_56 2) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse15 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) v_~cur~0_28 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))) (> 0 aux_mod_v_~cur~0_22_51) (< v_~prev~0_24 (+ c_~prev~0 v_~cur~0_28 v_~cur~0_26 c_~cur~0)) (< v_~cur~0_26 (+ c_~prev~0 (* 2 v_~cur~0_28) 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 ((.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)))))) (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))) (<= c_~j~0 .cse17) (forall ((v_~cur~0_28 Int) (aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse18 (* 2 v_~cur~0_26))) (or (< aux_div_v_~cur~0_22_51 (+ .cse18 c_~prev~0 v_~cur~0_28 1 c_~cur~0)) (< (+ 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) v_~cur~0_28 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (< v_~cur~0_28 (+ (* 2 c_~cur~0) c_~prev~0)) (>= aux_mod_v_~next~0_20_56 2) (> 0 aux_mod_v_~cur~0_22_51) (< v_~prev~0_24 (+ c_~prev~0 v_~cur~0_28 v_~cur~0_26 c_~cur~0)) (< v_~cur~0_26 (+ c_~prev~0 (* 2 v_~cur~0_28) 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)))))) (<= c_~j~0 .cse2) (<= c_~i~0 .cse5) (<= .cse8 .cse7) (<= (div (+ .cse13 (- 4) c_~next~0) (- 2)) .cse19) (<= 0 c_~prev~0) (forall ((v_~cur~0_28 Int)) (or (< v_~cur~0_28 (+ c_~prev~0 c_~cur~0)) (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 ((.cse20 (* 2 v_~cur~0_26))) (or (< v_~prev~0_24 (+ v_~cur~0_28 v_~cur~0_26 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (< aux_div_v_~cur~0_22_51 (+ .cse20 v_~cur~0_28 1 c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (> 0 aux_mod_v_~cur~0_22_51) (< v_~cur~0_26 (+ (* 2 v_~cur~0_28) c_~cur~0)) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse20 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) (* 2 aux_div_v_~next~0_20_56) v_~cur~0_28 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)))))) (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 (< v_~prev~0_24 (+ v_~cur~0_28 v_~cur~0_26 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (< aux_div_v_~cur~0_22_51 (+ .cse21 v_~cur~0_28 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) (< v_~cur~0_26 (+ (* 2 v_~cur~0_28) c_~cur~0)) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse21 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) (* 2 aux_div_v_~next~0_20_56) v_~cur~0_28 c_~cur~0)) (> 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))) (<= (div (+ .cse13 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|) (<= .cse6 .cse9) (<= c_~j~0 |c_ULTIMATE.start_fib_#res#1|) (<= (div (+ .cse23 c_~next~0 (- 8) c_~cur~0) (- 2)) .cse22) (<= 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 ((.cse24 (* 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) (+ .cse24 (* 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 (+ .cse24 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 .cse23 (- 6) c_~cur~0) (- 2)) .cse14) (<= (div (+ .cse23 (- 4) c_~next~0) (- 2)) .cse19) (<= c_~i~0 .cse17) (<= 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-02-19 17:19:46,942 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 460 transitions and produced 430 states. [2022-02-19 17:19:46,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:19:46,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:19:46,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:19:46,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-19 17:19:46,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-02-19 17:19:46,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-02-19 17:19:46,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:19:46,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-19 17:19:46,951 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-19 17:19:46,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:19:46,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1689007187, now seen corresponding path program 1 times [2022-02-19 17:19:46,953 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:19:46,953 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642379214] [2022-02-19 17:19:46,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:19:46,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:19:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:19:47,041 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2022-02-19 17:19:47,041 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:19:47,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642379214] [2022-02-19 17:19:47,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642379214] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 17:19:47,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399325012] [2022-02-19 17:19:47,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:19:47,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:19:47,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:19:47,043 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-19 17:19:47,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-19 17:19:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:19:47,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-19 17:19:47,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 17:19:47,354 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2022-02-19 17:19:47,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 17:19:47,555 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2022-02-19 17:19:47,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399325012] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 17:19:47,555 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 17:19:47,555 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-19 17:19:47,556 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064668582] [2022-02-19 17:19:47,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 17:19:47,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-19 17:19:47,556 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:19:47,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-19 17:19:47,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-19 17:19:47,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:19:47,557 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:19:47,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-19 17:19:47,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:19:47,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:19:47,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:19:47,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-19 17:19:47,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-02-19 17:19:47,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-02-19 17:19:47,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:19:47,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:19:48,142 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 444 transitions and produced 422 states. [2022-02-19 17:19:48,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:19:48,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:19:48,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:19:48,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-19 17:19:48,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-02-19 17:19:48,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-02-19 17:19:48,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:19:48,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-19 17:19:48,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-19 17:19:48,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:19:48,355 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-19 17:19:48,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:19:48,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1989318246, now seen corresponding path program 1 times [2022-02-19 17:19:48,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:19:48,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734697311] [2022-02-19 17:19:48,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:19:48,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:19:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:19:51,932 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 0 proven. 653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:19:51,933 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:19:51,933 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734697311] [2022-02-19 17:19:51,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734697311] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 17:19:51,933 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964385263] [2022-02-19 17:19:51,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:19:51,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:19:51,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:19:51,934 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-19 17:19:51,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-19 17:19:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:19:52,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 49 conjunts are in the unsatisfiable core [2022-02-19 17:19:52,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 17:20:01,946 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 486 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:20:01,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2022-02-19 17:21:51,371 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-19 17:21:51,371 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-19 17:21:51,371 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-19 17:21:51,892 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-02-19 17:21:51,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-19 17:21:52,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:21:52,093 WARN L594 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 161 with TraceHistMax 14,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 134 known predicates. [2022-02-19 17:21:52,094 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-02-19 17:21:52,094 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-02-19 17:21:52,098 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2022-02-19 17:21:52,100 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-19 17:21:52,100 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-19 17:21:52,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.02 05:21:52 BasicIcfg [2022-02-19 17:21:52,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-19 17:21:52,102 INFO L158 Benchmark]: Toolchain (without parser) took 876831.00ms. Allocated memory was 207.6MB in the beginning and 461.4MB in the end (delta: 253.8MB). Free memory was 159.1MB in the beginning and 321.5MB in the end (delta: -162.4MB). Peak memory consumption was 91.6MB. Max. memory is 8.0GB. [2022-02-19 17:21:52,102 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 207.6MB. Free memory is still 176.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-19 17:21:52,102 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.16ms. Allocated memory is still 207.6MB. Free memory was 158.9MB in the beginning and 178.1MB in the end (delta: -19.2MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. [2022-02-19 17:21:52,102 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.75ms. Allocated memory is still 207.6MB. Free memory was 178.1MB in the beginning and 176.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-19 17:21:52,102 INFO L158 Benchmark]: Boogie Preprocessor took 14.81ms. Allocated memory is still 207.6MB. Free memory was 176.5MB in the beginning and 174.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-19 17:21:52,103 INFO L158 Benchmark]: RCFGBuilder took 333.30ms. Allocated memory is still 207.6MB. Free memory was 174.9MB in the beginning and 161.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-02-19 17:21:52,103 INFO L158 Benchmark]: TraceAbstraction took 876020.50ms. Allocated memory was 207.6MB in the beginning and 461.4MB in the end (delta: 253.8MB). Free memory was 161.3MB in the beginning and 321.5MB in the end (delta: -160.2MB). Peak memory consumption was 93.1MB. Max. memory is 8.0GB. [2022-02-19 17:21:52,104 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 207.6MB. Free memory is still 176.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 434.16ms. Allocated memory is still 207.6MB. Free memory was 158.9MB in the beginning and 178.1MB in the end (delta: -19.2MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.75ms. Allocated memory is still 207.6MB. Free memory was 178.1MB in the beginning and 176.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.81ms. Allocated memory is still 207.6MB. Free memory was 176.5MB in the beginning and 174.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 333.30ms. Allocated memory is still 207.6MB. Free memory was 174.9MB in the beginning and 161.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 876020.50ms. Allocated memory was 207.6MB in the beginning and 461.4MB in the end (delta: 253.8MB). Free memory was 161.3MB in the beginning and 321.5MB in the end (delta: -160.2MB). Peak memory consumption was 93.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 726]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 161 with TraceHistMax 14,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 134 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 PartialOrderCegarLoop was analyzing trace of length 161 with TraceHistMax 14,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 134 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 PartialOrderCegarLoop was analyzing trace of length 161 with TraceHistMax 14,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 134 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.9s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 160.7s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 589.5s InterpolantComputationTime, 1375 NumberOfCodeBlocks, 1358 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1909 ConstructedInterpolants, 88 QuantifiedInterpolants, 19129 SizeOfPredicates, 70 NumberOfNonLiveVariables, 1178 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 3092/5099 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown