./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_o200.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_o200.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d03bd1f663815b2d7649a36366d573d68ceb56233e8a1c24e8a8623e8a524f12 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:05:15,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:05:15,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:05:15,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:05:15,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:05:15,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:05:15,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:05:15,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:05:15,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:05:15,455 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:05:15,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:05:15,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:05:15,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:05:15,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:05:15,459 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:05:15,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:05:15,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:05:15,460 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:05:15,461 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:05:15,461 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:05:15,461 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:05:15,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:05:15,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:05:15,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:05:15,466 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:05:15,466 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:05:15,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:05:15,467 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:05:15,467 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:05:15,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:05:15,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:05:15,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:05:15,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:05:15,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:05:15,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:05:15,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:05:15,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:05:15,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:05:15,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:05:15,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:05:15,473 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:05:15,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:05:15,474 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-clean/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d03bd1f663815b2d7649a36366d573d68ceb56233e8a1c24e8a8623e8a524f12 [2024-10-11 03:05:15,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:05:15,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:05:15,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:05:15,761 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:05:15,762 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:05:15,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_o200.c [2024-10-11 03:05:17,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:05:17,494 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:05:17,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_o200.c [2024-10-11 03:05:17,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f19292bed/59dca9046d194e3fa29b5209f537ee67/FLAGc6cbda294 [2024-10-11 03:05:17,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f19292bed/59dca9046d194e3fa29b5209f537ee67 [2024-10-11 03:05:17,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:05:17,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:05:17,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:05:17,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:05:17,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:05:17,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:05:17" (1/1) ... [2024-10-11 03:05:17,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577e0e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:17, skipping insertion in model container [2024-10-11 03:05:17,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:05:17" (1/1) ... [2024-10-11 03:05:17,545 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:05:17,766 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_o200.c[518,531] [2024-10-11 03:05:17,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:05:17,784 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:05:17,799 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_o200.c[518,531] [2024-10-11 03:05:17,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:05:17,823 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:05:17,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:17 WrapperNode [2024-10-11 03:05:17,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:05:17,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:05:17,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:05:17,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:05:17,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:17" (1/1) ... [2024-10-11 03:05:17,839 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:17" (1/1) ... [2024-10-11 03:05:17,853 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2024-10-11 03:05:17,853 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:05:17,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:05:17,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:05:17,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:05:17,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:17" (1/1) ... [2024-10-11 03:05:17,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:17" (1/1) ... [2024-10-11 03:05:17,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:17" (1/1) ... [2024-10-11 03:05:17,876 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:05:17,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:17" (1/1) ... [2024-10-11 03:05:17,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:17" (1/1) ... [2024-10-11 03:05:17,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:17" (1/1) ... [2024-10-11 03:05:17,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:17" (1/1) ... [2024-10-11 03:05:17,882 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:17" (1/1) ... [2024-10-11 03:05:17,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:17" (1/1) ... [2024-10-11 03:05:17,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:05:17,889 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:05:17,889 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:05:17,889 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:05:17,889 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:17" (1/1) ... [2024-10-11 03:05:17,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:05:17,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:05:17,923 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:05:17,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:05:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:05:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:05:17,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:05:17,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:05:17,972 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-10-11 03:05:17,972 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-10-11 03:05:18,031 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:05:18,033 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:05:18,123 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-11 03:05:18,123 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:05:18,145 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:05:18,146 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:05:18,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:05:18 BoogieIcfgContainer [2024-10-11 03:05:18,147 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:05:18,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:05:18,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:05:18,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:05:18,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:05:17" (1/3) ... [2024-10-11 03:05:18,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c0d2e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:05:18, skipping insertion in model container [2024-10-11 03:05:18,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:05:17" (2/3) ... [2024-10-11 03:05:18,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c0d2e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:05:18, skipping insertion in model container [2024-10-11 03:05:18,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:05:18" (3/3) ... [2024-10-11 03:05:18,157 INFO L112 eAbstractionObserver]: Analyzing ICFG id_o200.c [2024-10-11 03:05:18,170 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:05:18,170 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:05:18,225 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:05:18,230 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@701208fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:05:18,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:05:18,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 03:05:18,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 03:05:18,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:05:18,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:05:18,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:05:18,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:05:18,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1493244868, now seen corresponding path program 1 times [2024-10-11 03:05:18,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:05:18,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201289759] [2024-10-11 03:05:18,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:05:18,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:05:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:18,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:05:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:05:18,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:05:18,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201289759] [2024-10-11 03:05:18,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201289759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:05:18,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:05:18,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:05:18,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107748540] [2024-10-11 03:05:18,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:05:18,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:05:18,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:05:18,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:05:18,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:05:18,685 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:05:18,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:05:18,731 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2024-10-11 03:05:18,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:05:18,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-10-11 03:05:18,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:05:18,744 INFO L225 Difference]: With dead ends: 22 [2024-10-11 03:05:18,744 INFO L226 Difference]: Without dead ends: 14 [2024-10-11 03:05:18,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:05:18,750 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:05:18,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:05:18,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-11 03:05:18,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-11 03:05:18,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 03:05:18,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-10-11 03:05:18,787 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2024-10-11 03:05:18,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:05:18,788 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-10-11 03:05:18,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:05:18,788 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-10-11 03:05:18,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 03:05:18,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:05:18,790 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:05:18,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:05:18,790 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:05:18,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:05:18,791 INFO L85 PathProgramCache]: Analyzing trace with hash -642736818, now seen corresponding path program 1 times [2024-10-11 03:05:18,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:05:18,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761494878] [2024-10-11 03:05:18,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:05:18,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:05:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:18,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:05:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:19,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:19,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:05:19,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:05:19,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761494878] [2024-10-11 03:05:19,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761494878] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:05:19,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755228820] [2024-10-11 03:05:19,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:05:19,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:19,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:05:19,091 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:05:19,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:05:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:19,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 03:05:19,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:05:19,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:05:19,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:05:19,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:05:19,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755228820] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:05:19,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:05:19,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-11 03:05:19,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004528049] [2024-10-11 03:05:19,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:05:19,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:05:19,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:05:19,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:05:19,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:05:19,409 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 03:05:19,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:05:19,468 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-10-11 03:05:19,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:05:19,469 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 15 [2024-10-11 03:05:19,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:05:19,470 INFO L225 Difference]: With dead ends: 26 [2024-10-11 03:05:19,470 INFO L226 Difference]: Without dead ends: 20 [2024-10-11 03:05:19,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:05:19,473 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:05:19,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:05:19,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-11 03:05:19,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-11 03:05:19,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:05:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2024-10-11 03:05:19,480 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 15 [2024-10-11 03:05:19,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:05:19,480 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-10-11 03:05:19,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 03:05:19,480 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2024-10-11 03:05:19,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 03:05:19,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:05:19,481 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:05:19,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:05:19,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:19,688 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:05:19,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:05:19,689 INFO L85 PathProgramCache]: Analyzing trace with hash 54189198, now seen corresponding path program 2 times [2024-10-11 03:05:19,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:05:19,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142453812] [2024-10-11 03:05:19,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:05:19,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:05:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:19,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:05:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:19,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:19,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:20,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 03:05:20,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:05:20,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142453812] [2024-10-11 03:05:20,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142453812] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:05:20,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115617786] [2024-10-11 03:05:20,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 03:05:20,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:20,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:05:20,061 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:05:20,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:05:20,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 03:05:20,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:05:20,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 03:05:20,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:05:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 03:05:20,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:05:20,505 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 03:05:20,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115617786] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:05:20,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:05:20,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2024-10-11 03:05:20,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914383669] [2024-10-11 03:05:20,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:05:20,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 03:05:20,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:05:20,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 03:05:20,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:05:20,513 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 13 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 03:05:20,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:05:20,714 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-10-11 03:05:20,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 03:05:20,715 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 13 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) Word has length 27 [2024-10-11 03:05:20,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:05:20,717 INFO L225 Difference]: With dead ends: 38 [2024-10-11 03:05:20,717 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 03:05:20,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:05:20,720 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:05:20,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:05:20,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 03:05:20,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-11 03:05:20,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 03:05:20,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-10-11 03:05:20,731 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 27 [2024-10-11 03:05:20,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:05:20,731 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-10-11 03:05:20,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 13 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 03:05:20,731 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-10-11 03:05:20,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 03:05:20,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:05:20,733 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:05:20,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 03:05:20,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:20,934 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:05:20,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:05:20,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1466649358, now seen corresponding path program 3 times [2024-10-11 03:05:20,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:05:20,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251448054] [2024-10-11 03:05:20,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:05:20,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:05:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:21,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:05:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:21,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:21,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:21,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:21,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:21,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:21,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:21,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:21,696 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-11 03:05:21,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:05:21,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251448054] [2024-10-11 03:05:21,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251448054] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:05:21,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424901442] [2024-10-11 03:05:21,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 03:05:21,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:21,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:05:21,699 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:05:21,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:05:21,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-10-11 03:05:21,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:05:21,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-11 03:05:21,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:05:21,836 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-11 03:05:21,838 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:05:22,773 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-11 03:05:22,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424901442] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:05:22,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:05:22,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2024-10-11 03:05:22,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268777412] [2024-10-11 03:05:22,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:05:22,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-11 03:05:22,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:05:22,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-11 03:05:22,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 03:05:22,777 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 37 states, 37 states have (on average 1.135135135135135) internal successors, (42), 21 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 03:05:23,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:05:23,651 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2024-10-11 03:05:23,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-11 03:05:23,652 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.135135135135135) internal successors, (42), 21 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) Word has length 51 [2024-10-11 03:05:23,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:05:23,653 INFO L225 Difference]: With dead ends: 62 [2024-10-11 03:05:23,653 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 03:05:23,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=386, Invalid=1966, Unknown=0, NotChecked=0, Total=2352 [2024-10-11 03:05:23,656 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:05:23,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 451 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:05:23,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 03:05:23,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-11 03:05:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 38 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 03:05:23,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2024-10-11 03:05:23,668 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 51 [2024-10-11 03:05:23,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:05:23,668 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2024-10-11 03:05:23,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.135135135135135) internal successors, (42), 21 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 03:05:23,669 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2024-10-11 03:05:23,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 03:05:23,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:05:23,672 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:05:23,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 03:05:23,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:23,876 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:05:23,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:05:23,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1758730226, now seen corresponding path program 4 times [2024-10-11 03:05:23,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:05:23,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892244209] [2024-10-11 03:05:23,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:05:23,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:05:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:24,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:05:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:24,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:24,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:24,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:24,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:25,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:25,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:25,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:25,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:25,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:25,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:25,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:25,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:25,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:25,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:26,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:26,106 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-10-11 03:05:26,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:05:26,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892244209] [2024-10-11 03:05:26,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892244209] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:05:26,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010460011] [2024-10-11 03:05:26,107 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 03:05:26,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:26,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:05:26,110 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:05:26,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:05:26,177 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 03:05:26,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:05:26,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-10-11 03:05:26,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:05:26,296 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-10-11 03:05:26,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:05:28,913 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-10-11 03:05:28,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010460011] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:05:28,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:05:28,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2024-10-11 03:05:28,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856918856] [2024-10-11 03:05:28,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:05:28,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2024-10-11 03:05:28,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:05:28,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2024-10-11 03:05:28,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=620, Invalid=4072, Unknown=0, NotChecked=0, Total=4692 [2024-10-11 03:05:28,919 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 69 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 37 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (32), 32 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 03:05:44,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:05:44,884 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2024-10-11 03:05:44,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-10-11 03:05:44,886 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 37 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (32), 32 states have call predecessors, (32), 1 states have call successors, (32) Word has length 99 [2024-10-11 03:05:44,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:05:44,888 INFO L225 Difference]: With dead ends: 110 [2024-10-11 03:05:44,888 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 03:05:44,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=1530, Invalid=7782, Unknown=0, NotChecked=0, Total=9312 [2024-10-11 03:05:44,894 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:05:44,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1188 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:05:44,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 03:05:44,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-11 03:05:44,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 70 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (33), 32 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 03:05:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2024-10-11 03:05:44,924 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 99 [2024-10-11 03:05:44,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:05:44,924 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2024-10-11 03:05:44,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 37 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (32), 32 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 03:05:44,925 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2024-10-11 03:05:44,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-11 03:05:44,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:05:44,928 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:05:44,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 03:05:45,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:45,131 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:05:45,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:05:45,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1940660750, now seen corresponding path program 5 times [2024-10-11 03:05:45,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:05:45,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565313160] [2024-10-11 03:05:45,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:05:45,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:05:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:45,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:05:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:46,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:47,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:47,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:48,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:48,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:49,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:49,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:49,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:50,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:50,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:51,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:51,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:51,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:51,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:52,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:52,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:52,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:52,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:52,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:53,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:53,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:53,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:53,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:53,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:53,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:53,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:54,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:54,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:54,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:54,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:54,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:05:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:05:54,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2914 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2024-10-11 03:05:54,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:05:54,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565313160] [2024-10-11 03:05:54,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565313160] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:05:54,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123486976] [2024-10-11 03:05:54,525 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 03:05:54,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:54,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:05:54,527 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:05:54,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 03:05:54,774 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2024-10-11 03:05:54,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:05:54,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 132 conjuncts are in the unsatisfiable core [2024-10-11 03:05:54,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:05:55,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2914 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2024-10-11 03:05:55,003 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:06:03,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2914 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2024-10-11 03:06:03,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123486976] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:06:03,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:06:03,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2024-10-11 03:06:03,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882410951] [2024-10-11 03:06:03,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:06:03,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 133 states [2024-10-11 03:06:03,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:06:03,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2024-10-11 03:06:03,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2252, Invalid=15304, Unknown=0, NotChecked=0, Total=17556 [2024-10-11 03:06:03,513 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand has 133 states, 133 states have (on average 1.037593984962406) internal successors, (138), 69 states have internal predecessors, (138), 1 states have call successors, (2), 1 states have call predecessors, (2), 64 states have return successors, (64), 64 states have call predecessors, (64), 1 states have call successors, (64) [2024-10-11 03:06:32,295 WARN L286 SmtUtils]: Spent 26.24s on a formula simplification that was a NOOP. DAG size: 159 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)