./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1ae4a3f744c0a8577333c2c3dfb4ecaabbd2cf6e1675b06577194a98b8d1aee1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 13:11:05,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 13:11:05,612 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 13:11:05,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 13:11:05,619 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 13:11:05,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 13:11:05,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 13:11:05,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 13:11:05,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 13:11:05,652 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 13:11:05,652 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 13:11:05,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 13:11:05,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 13:11:05,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 13:11:05,654 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 13:11:05,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 13:11:05,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 13:11:05,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 13:11:05,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 13:11:05,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 13:11:05,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 13:11:05,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 13:11:05,658 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 13:11:05,658 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 13:11:05,658 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 13:11:05,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 13:11:05,659 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 13:11:05,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 13:11:05,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 13:11:05,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 13:11:05,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 13:11:05,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:11:05,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 13:11:05,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 13:11:05,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 13:11:05,661 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 13:11:05,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 13:11:05,661 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 13:11:05,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 13:11:05,663 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 13:11:05,663 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 13:11:05,663 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/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/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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ae4a3f744c0a8577333c2c3dfb4ecaabbd2cf6e1675b06577194a98b8d1aee1 [2024-10-13 13:11:05,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 13:11:05,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 13:11:05,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 13:11:05,931 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 13:11:05,932 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 13:11:05,933 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2024-10-13 13:11:07,340 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 13:11:07,524 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 13:11:07,524 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2024-10-13 13:11:07,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bbd7ee62/e0951788c8d942e2ac7dd291c780b1cb/FLAG6361f2a8c [2024-10-13 13:11:07,564 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bbd7ee62/e0951788c8d942e2ac7dd291c780b1cb [2024-10-13 13:11:07,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 13:11:07,568 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 13:11:07,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 13:11:07,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 13:11:07,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 13:11:07,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:11:07" (1/1) ... [2024-10-13 13:11:07,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@591074b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:07, skipping insertion in model container [2024-10-13 13:11:07,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:11:07" (1/1) ... [2024-10-13 13:11:07,609 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 13:11:07,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:11:07,795 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 13:11:07,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:11:07,836 INFO L204 MainTranslator]: Completed translation [2024-10-13 13:11:07,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:07 WrapperNode [2024-10-13 13:11:07,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 13:11:07,838 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 13:11:07,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 13:11:07,838 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 13:11:07,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:07" (1/1) ... [2024-10-13 13:11:07,851 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:07" (1/1) ... [2024-10-13 13:11:07,866 INFO L138 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2024-10-13 13:11:07,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 13:11:07,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 13:11:07,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 13:11:07,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 13:11:07,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:07" (1/1) ... [2024-10-13 13:11:07,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:07" (1/1) ... [2024-10-13 13:11:07,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:07" (1/1) ... [2024-10-13 13:11:07,904 INFO L175 MemorySlicer]: Split 6 memory accesses to 1 slices as follows [6]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2024-10-13 13:11:07,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:07" (1/1) ... [2024-10-13 13:11:07,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:07" (1/1) ... [2024-10-13 13:11:07,911 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:07" (1/1) ... [2024-10-13 13:11:07,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:07" (1/1) ... [2024-10-13 13:11:07,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:07" (1/1) ... [2024-10-13 13:11:07,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:07" (1/1) ... [2024-10-13 13:11:07,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 13:11:07,928 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 13:11:07,928 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 13:11:07,928 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 13:11:07,929 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:07" (1/1) ... [2024-10-13 13:11:07,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:11:07,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:11:07,964 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 13:11:07,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 13:11:08,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 13:11:08,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 13:11:08,012 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2024-10-13 13:11:08,012 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2024-10-13 13:11:08,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 13:11:08,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 13:11:08,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 13:11:08,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 13:11:08,087 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 13:11:08,089 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 13:11:08,288 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-13 13:11:08,288 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 13:11:08,315 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 13:11:08,316 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 13:11:08,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:11:08 BoogieIcfgContainer [2024-10-13 13:11:08,316 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 13:11:08,319 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 13:11:08,319 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 13:11:08,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 13:11:08,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:11:07" (1/3) ... [2024-10-13 13:11:08,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2d03cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:11:08, skipping insertion in model container [2024-10-13 13:11:08,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:07" (2/3) ... [2024-10-13 13:11:08,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2d03cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:11:08, skipping insertion in model container [2024-10-13 13:11:08,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:11:08" (3/3) ... [2024-10-13 13:11:08,328 INFO L112 eAbstractionObserver]: Analyzing ICFG insertionSort_recursive.i [2024-10-13 13:11:08,343 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 13:11:08,344 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-10-13 13:11:08,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 13:11:08,404 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;@4547d59a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 13:11:08,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-13 13:11:08,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 34 states have internal predecessors, (41), 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-13 13:11:08,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 13:11:08,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:11:08,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 13:11:08,414 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:11:08,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:11:08,420 INFO L85 PathProgramCache]: Analyzing trace with hash 3480497, now seen corresponding path program 1 times [2024-10-13 13:11:08,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:11:08,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61881788] [2024-10-13 13:11:08,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:11:08,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:11:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:11:08,669 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-13 13:11:08,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:11:08,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61881788] [2024-10-13 13:11:08,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61881788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:11:08,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:11:08,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:11:08,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906947975] [2024-10-13 13:11:08,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:11:08,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:11:08,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:11:08,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:11:08,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:11:08,702 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 34 states have internal predecessors, (41), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) [2024-10-13 13:11:08,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:11:08,765 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2024-10-13 13:11:08,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:11:08,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) Word has length 4 [2024-10-13 13:11:08,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:11:08,772 INFO L225 Difference]: With dead ends: 74 [2024-10-13 13:11:08,772 INFO L226 Difference]: Without dead ends: 35 [2024-10-13 13:11:08,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:11:08,778 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:11:08,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 104 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:11:08,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-13 13:11:08,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-13 13:11:08,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.608695652173913) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:08,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-10-13 13:11:08,806 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 4 [2024-10-13 13:11:08,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:11:08,807 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-10-13 13:11:08,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) [2024-10-13 13:11:08,807 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-10-13 13:11:08,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 13:11:08,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:11:08,808 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-13 13:11:08,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 13:11:08,808 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:11:08,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:11:08,809 INFO L85 PathProgramCache]: Analyzing trace with hash 608368800, now seen corresponding path program 1 times [2024-10-13 13:11:08,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:11:08,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348777647] [2024-10-13 13:11:08,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:11:08,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:11:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:11:08,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:11:08,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:11:08,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348777647] [2024-10-13 13:11:08,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348777647] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:11:08,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537870114] [2024-10-13 13:11:08,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:11:08,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:11:08,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:11:08,946 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:11:08,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 13:11:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:11:09,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 13:11:09,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:11:09,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:11:09,125 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:11:09,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537870114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:11:09,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:11:09,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-13 13:11:09,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568212109] [2024-10-13 13:11:09,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:11:09,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 13:11:09,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:11:09,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 13:11:09,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 13:11:09,129 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 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) [2024-10-13 13:11:09,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:11:09,176 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-10-13 13:11:09,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 13:11:09,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 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) Word has length 7 [2024-10-13 13:11:09,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:11:09,179 INFO L225 Difference]: With dead ends: 35 [2024-10-13 13:11:09,180 INFO L226 Difference]: Without dead ends: 34 [2024-10-13 13:11:09,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 13:11:09,181 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:11:09,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 106 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:11:09,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-13 13:11:09,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-13 13:11:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.565217391304348) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:09,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-10-13 13:11:09,191 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 7 [2024-10-13 13:11:09,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:11:09,192 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-10-13 13:11:09,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 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) [2024-10-13 13:11:09,192 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-10-13 13:11:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 13:11:09,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:11:09,192 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2024-10-13 13:11:09,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 13:11:09,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:11:09,394 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:11:09,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:11:09,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1679563714, now seen corresponding path program 1 times [2024-10-13 13:11:09,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:11:09,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036427716] [2024-10-13 13:11:09,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:11:09,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:11:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:11:09,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:11:09,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:11:09,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036427716] [2024-10-13 13:11:09,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036427716] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:11:09,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363796696] [2024-10-13 13:11:09,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:11:09,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:11:09,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:11:09,533 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) [2024-10-13 13:11:09,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 13:11:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:11:09,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 13:11:09,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:11:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:11:09,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:11:09,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:11:09,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363796696] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:11:09,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:11:09,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-13 13:11:09,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861535600] [2024-10-13 13:11:09,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:11:09,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 13:11:09,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:11:09,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 13:11:09,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:11:09,698 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 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) [2024-10-13 13:11:09,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:11:09,772 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-10-13 13:11:09,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 13:11:09,774 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 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) Word has length 8 [2024-10-13 13:11:09,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:11:09,775 INFO L225 Difference]: With dead ends: 44 [2024-10-13 13:11:09,775 INFO L226 Difference]: Without dead ends: 43 [2024-10-13 13:11:09,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:11:09,777 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:11:09,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:11:09,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-13 13:11:09,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-13 13:11:09,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.5) internal successors, (48), 41 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2024-10-13 13:11:09,789 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 8 [2024-10-13 13:11:09,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:11:09,789 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-10-13 13:11:09,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 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) [2024-10-13 13:11:09,790 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-10-13 13:11:09,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 13:11:09,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:11:09,790 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:11:09,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 13:11:09,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-10-13 13:11:09,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:11:09,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:11:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash -981887996, now seen corresponding path program 1 times [2024-10-13 13:11:09,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:11:09,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086307793] [2024-10-13 13:11:09,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:11:09,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:11:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:11:10,064 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-13 13:11:10,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:11:10,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086307793] [2024-10-13 13:11:10,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086307793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:11:10,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:11:10,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:11:10,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649881269] [2024-10-13 13:11:10,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:11:10,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:11:10,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:11:10,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:11:10,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:11:10,070 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:10,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:11:10,086 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2024-10-13 13:11:10,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:11:10,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 13:11:10,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:11:10,088 INFO L225 Difference]: With dead ends: 68 [2024-10-13 13:11:10,089 INFO L226 Difference]: Without dead ends: 43 [2024-10-13 13:11:10,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:11:10,091 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:11:10,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:11:10,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-13 13:11:10,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-13 13:11:10,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.46875) internal successors, (47), 41 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:10,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-10-13 13:11:10,100 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 10 [2024-10-13 13:11:10,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:11:10,100 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-10-13 13:11:10,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:10,101 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-10-13 13:11:10,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 13:11:10,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:11:10,101 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:11:10,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 13:11:10,102 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:11:10,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:11:10,103 INFO L85 PathProgramCache]: Analyzing trace with hash 698597811, now seen corresponding path program 1 times [2024-10-13 13:11:10,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:11:10,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100369274] [2024-10-13 13:11:10,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:11:10,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:11:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:11:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 13:11:10,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:11:10,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100369274] [2024-10-13 13:11:10,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100369274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:11:10,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:11:10,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 13:11:10,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435043115] [2024-10-13 13:11:10,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:11:10,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:11:10,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:11:10,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:11:10,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:11:10,205 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:11:10,288 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2024-10-13 13:11:10,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:11:10,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-13 13:11:10,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:11:10,293 INFO L225 Difference]: With dead ends: 78 [2024-10-13 13:11:10,293 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 13:11:10,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:11:10,294 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 68 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:11:10,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 90 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:11:10,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 13:11:10,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2024-10-13 13:11:10,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 53 states have (on average 1.471698113207547) internal successors, (78), 61 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2024-10-13 13:11:10,302 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 13 [2024-10-13 13:11:10,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:11:10,302 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2024-10-13 13:11:10,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:10,303 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2024-10-13 13:11:10,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 13:11:10,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:11:10,303 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:11:10,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 13:11:10,304 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting insertionSortErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:11:10,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:11:10,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1478234453, now seen corresponding path program 1 times [2024-10-13 13:11:10,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:11:10,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447464241] [2024-10-13 13:11:10,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:11:10,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:11:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:11:10,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 13:11:10,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:11:10,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447464241] [2024-10-13 13:11:10,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447464241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:11:10,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:11:10,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:11:10,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411552029] [2024-10-13 13:11:10,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:11:10,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:11:10,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:11:10,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:11:10,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:11:10,350 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:10,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:11:10,376 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2024-10-13 13:11:10,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:11:10,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-13 13:11:10,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:11:10,378 INFO L225 Difference]: With dead ends: 104 [2024-10-13 13:11:10,379 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 13:11:10,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:11:10,381 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:11:10,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:11:10,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 13:11:10,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-10-13 13:11:10,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 63 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:10,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2024-10-13 13:11:10,397 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 16 [2024-10-13 13:11:10,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:11:10,397 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2024-10-13 13:11:10,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:10,398 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2024-10-13 13:11:10,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 13:11:10,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:11:10,399 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1] [2024-10-13 13:11:10,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 13:11:10,400 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:11:10,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:11:10,400 INFO L85 PathProgramCache]: Analyzing trace with hash -955437167, now seen corresponding path program 2 times [2024-10-13 13:11:10,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:11:10,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850089409] [2024-10-13 13:11:10,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:11:10,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:11:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:11:10,614 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:11:10,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:11:10,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850089409] [2024-10-13 13:11:10,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850089409] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:11:10,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001355770] [2024-10-13 13:11:10,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 13:11:10,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:11:10,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:11:10,617 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) [2024-10-13 13:11:10,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 13:11:10,659 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 13:11:10,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:11:10,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 13:11:10,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:11:10,705 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-13 13:11:10,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:11:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-13 13:11:10,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001355770] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:11:10,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:11:10,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 2, 2] total 13 [2024-10-13 13:11:10,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460973619] [2024-10-13 13:11:10,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:11:10,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 13:11:10,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:11:10,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 13:11:10,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-13 13:11:10,741 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 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) [2024-10-13 13:11:10,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:11:10,893 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2024-10-13 13:11:10,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 13:11:10,893 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 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) Word has length 17 [2024-10-13 13:11:10,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:11:10,894 INFO L225 Difference]: With dead ends: 69 [2024-10-13 13:11:10,894 INFO L226 Difference]: Without dead ends: 68 [2024-10-13 13:11:10,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2024-10-13 13:11:10,896 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:11:10,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 152 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:11:10,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-13 13:11:10,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2024-10-13 13:11:10,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 51 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2024-10-13 13:11:10,901 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 17 [2024-10-13 13:11:10,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:11:10,901 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2024-10-13 13:11:10,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 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) [2024-10-13 13:11:10,902 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2024-10-13 13:11:10,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 13:11:10,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:11:10,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:11:10,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 13:11:11,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:11:11,103 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting insertionSortErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:11:11,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:11:11,104 INFO L85 PathProgramCache]: Analyzing trace with hash -276505561, now seen corresponding path program 1 times [2024-10-13 13:11:11,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:11:11,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251298503] [2024-10-13 13:11:11,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:11:11,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:11:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:11:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 13:11:11,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:11:11,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251298503] [2024-10-13 13:11:11,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251298503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:11:11,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:11:11,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 13:11:11,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916455963] [2024-10-13 13:11:11,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:11:11,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 13:11:11,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:11:11,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 13:11:11,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 13:11:11,171 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:11,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:11:11,243 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2024-10-13 13:11:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 13:11:11,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-13 13:11:11,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:11:11,244 INFO L225 Difference]: With dead ends: 83 [2024-10-13 13:11:11,244 INFO L226 Difference]: Without dead ends: 41 [2024-10-13 13:11:11,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:11:11,245 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:11:11,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 102 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:11:11,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-13 13:11:11,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-10-13 13:11:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:11,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2024-10-13 13:11:11,249 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 18 [2024-10-13 13:11:11,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:11:11,249 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2024-10-13 13:11:11,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:11,250 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2024-10-13 13:11:11,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 13:11:11,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:11:11,250 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:11:11,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 13:11:11,250 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:11:11,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:11:11,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1299292871, now seen corresponding path program 1 times [2024-10-13 13:11:11,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:11:11,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469621357] [2024-10-13 13:11:11,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:11:11,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:11:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:11:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:11:11,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:11:11,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469621357] [2024-10-13 13:11:11,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469621357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:11:11,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:11:11,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:11:11,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49871421] [2024-10-13 13:11:11,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:11:11,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:11:11,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:11:11,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:11:11,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:11:11,298 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:11,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:11:11,329 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2024-10-13 13:11:11,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:11:11,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-13 13:11:11,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:11:11,330 INFO L225 Difference]: With dead ends: 41 [2024-10-13 13:11:11,330 INFO L226 Difference]: Without dead ends: 39 [2024-10-13 13:11:11,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:11:11,331 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:11:11,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 51 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:11:11,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-13 13:11:11,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2024-10-13 13:11:11,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.3) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:11,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2024-10-13 13:11:11,337 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 22 [2024-10-13 13:11:11,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:11:11,338 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2024-10-13 13:11:11,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:11,338 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2024-10-13 13:11:11,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 13:11:11,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:11:11,339 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:11:11,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 13:11:11,339 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:11:11,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:11:11,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1623373381, now seen corresponding path program 1 times [2024-10-13 13:11:11,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:11:11,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992031130] [2024-10-13 13:11:11,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:11:11,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:11:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:11:11,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 13:11:11,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:11:11,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992031130] [2024-10-13 13:11:11,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992031130] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:11:11,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117120429] [2024-10-13 13:11:11,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:11:11,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:11:11,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:11:11,447 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) [2024-10-13 13:11:11,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 13:11:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:11:11,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 13:11:11,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:11:11,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 13:11:11,566 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:11:11,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117120429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:11:11,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:11:11,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-13 13:11:11,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805477344] [2024-10-13 13:11:11,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:11:11,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 13:11:11,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:11:11,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 13:11:11,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:11:11,568 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:11,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:11:11,630 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-10-13 13:11:11,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 13:11:11,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-13 13:11:11,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:11:11,631 INFO L225 Difference]: With dead ends: 38 [2024-10-13 13:11:11,631 INFO L226 Difference]: Without dead ends: 36 [2024-10-13 13:11:11,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-10-13 13:11:11,632 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 41 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:11:11,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 49 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:11:11,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-13 13:11:11,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-13 13:11:11,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:11,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-10-13 13:11:11,636 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 23 [2024-10-13 13:11:11,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:11:11,636 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-10-13 13:11:11,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:11,636 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-10-13 13:11:11,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 13:11:11,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:11:11,637 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:11:11,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 13:11:11,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:11:11,842 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting insertionSortErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:11:11,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:11:11,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1214845557, now seen corresponding path program 1 times [2024-10-13 13:11:11,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:11:11,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355679883] [2024-10-13 13:11:11,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:11:11,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:11:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:11:11,928 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 13:11:11,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:11:11,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355679883] [2024-10-13 13:11:11,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355679883] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:11:11,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396775978] [2024-10-13 13:11:11,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:11:11,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:11:11,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:11:11,933 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) [2024-10-13 13:11:11,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 13:11:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:11:11,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 13:11:11,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:11:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 13:11:12,055 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:11:12,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396775978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:11:12,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:11:12,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-10-13 13:11:12,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636228116] [2024-10-13 13:11:12,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:11:12,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 13:11:12,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:11:12,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 13:11:12,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-13 13:11:12,057 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 6 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:12,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:11:12,096 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-10-13 13:11:12,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:11:12,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-13 13:11:12,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:11:12,097 INFO L225 Difference]: With dead ends: 36 [2024-10-13 13:11:12,097 INFO L226 Difference]: Without dead ends: 35 [2024-10-13 13:11:12,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-13 13:11:12,098 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:11:12,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 56 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:11:12,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-13 13:11:12,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-13 13:11:12,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:12,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-10-13 13:11:12,102 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 24 [2024-10-13 13:11:12,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:11:12,102 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-10-13 13:11:12,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:12,102 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-10-13 13:11:12,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 13:11:12,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:11:12,103 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:11:12,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 13:11:12,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-13 13:11:12,304 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting insertionSortErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:11:12,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:11:12,304 INFO L85 PathProgramCache]: Analyzing trace with hash 994493467, now seen corresponding path program 1 times [2024-10-13 13:11:12,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:11:12,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411679969] [2024-10-13 13:11:12,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:11:12,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:11:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:11:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 13:11:12,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:11:12,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411679969] [2024-10-13 13:11:12,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411679969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:11:12,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:11:12,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 13:11:12,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020489889] [2024-10-13 13:11:12,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:11:12,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:11:12,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:11:12,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:11:12,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:11:12,381 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:12,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:11:12,432 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2024-10-13 13:11:12,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 13:11:12,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-13 13:11:12,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:11:12,433 INFO L225 Difference]: With dead ends: 48 [2024-10-13 13:11:12,433 INFO L226 Difference]: Without dead ends: 47 [2024-10-13 13:11:12,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:11:12,434 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:11:12,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 41 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:11:12,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-13 13:11:12,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2024-10-13 13:11:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 34 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-10-13 13:11:12,442 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 25 [2024-10-13 13:11:12,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:11:12,442 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-10-13 13:11:12,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:12,446 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-10-13 13:11:12,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 13:11:12,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:11:12,447 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:11:12,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 13:11:12,448 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting insertionSortErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:11:12,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:11:12,449 INFO L85 PathProgramCache]: Analyzing trace with hash 945538711, now seen corresponding path program 1 times [2024-10-13 13:11:12,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:11:12,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088261343] [2024-10-13 13:11:12,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:11:12,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:11:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:11:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 13:11:12,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:11:12,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088261343] [2024-10-13 13:11:12,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088261343] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:11:12,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941702055] [2024-10-13 13:11:12,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:11:12,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:11:12,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:11:12,538 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) [2024-10-13 13:11:12,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 13:11:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:11:12,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 13:11:12,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:11:12,647 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 13:11:12,647 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:11:12,715 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 13:11:12,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941702055] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:11:12,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:11:12,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-10-13 13:11:12,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040100442] [2024-10-13 13:11:12,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:11:12,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 13:11:12,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:11:12,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 13:11:12,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-10-13 13:11:12,717 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 14 states, 11 states have (on average 4.636363636363637) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:12,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:11:12,813 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2024-10-13 13:11:12,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 13:11:12,814 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.636363636363637) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-13 13:11:12,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:11:12,816 INFO L225 Difference]: With dead ends: 91 [2024-10-13 13:11:12,816 INFO L226 Difference]: Without dead ends: 90 [2024-10-13 13:11:12,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2024-10-13 13:11:12,817 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 86 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:11:12,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 179 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:11:12,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-13 13:11:12,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 69. [2024-10-13 13:11:12,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 64 states have internal predecessors, (77), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:12,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2024-10-13 13:11:12,831 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 27 [2024-10-13 13:11:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:11:12,832 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2024-10-13 13:11:12,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.636363636363637) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2024-10-13 13:11:12,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 13:11:12,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:11:12,833 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:11:12,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 13:11:13,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:11:13,034 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting insertionSortErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:11:13,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:11:13,034 INFO L85 PathProgramCache]: Analyzing trace with hash 945588115, now seen corresponding path program 1 times [2024-10-13 13:11:13,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:11:13,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917444465] [2024-10-13 13:11:13,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:11:13,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:11:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:11:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 13:11:13,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:11:13,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917444465] [2024-10-13 13:11:13,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917444465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:11:13,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:11:13,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:11:13,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951144181] [2024-10-13 13:11:13,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:11:13,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:11:13,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:11:13,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:11:13,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:11:13,072 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:13,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:11:13,095 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2024-10-13 13:11:13,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:11:13,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-13 13:11:13,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:11:13,097 INFO L225 Difference]: With dead ends: 72 [2024-10-13 13:11:13,097 INFO L226 Difference]: Without dead ends: 71 [2024-10-13 13:11:13,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:11:13,098 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:11:13,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 54 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:11:13,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-13 13:11:13,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2024-10-13 13:11:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 63 states have internal predecessors, (74), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2024-10-13 13:11:13,107 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 27 [2024-10-13 13:11:13,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:11:13,108 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2024-10-13 13:11:13,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:13,108 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2024-10-13 13:11:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 13:11:13,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:11:13,110 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:11:13,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 13:11:13,111 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting insertionSortErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:11:13,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:11:13,111 INFO L85 PathProgramCache]: Analyzing trace with hash -751539445, now seen corresponding path program 1 times [2024-10-13 13:11:13,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:11:13,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573361515] [2024-10-13 13:11:13,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:11:13,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:11:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:11:13,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 13:11:13,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:11:13,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573361515] [2024-10-13 13:11:13,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573361515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:11:13,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:11:13,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:11:13,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041572333] [2024-10-13 13:11:13,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:11:13,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:11:13,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:11:13,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:11:13,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:11:13,158 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:13,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:11:13,184 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2024-10-13 13:11:13,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:11:13,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-13 13:11:13,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:11:13,185 INFO L225 Difference]: With dead ends: 82 [2024-10-13 13:11:13,185 INFO L226 Difference]: Without dead ends: 81 [2024-10-13 13:11:13,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:11:13,186 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:11:13,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 60 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:11:13,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-13 13:11:13,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2024-10-13 13:11:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 62 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:13,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2024-10-13 13:11:13,191 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 28 [2024-10-13 13:11:13,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:11:13,192 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2024-10-13 13:11:13,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:13,192 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2024-10-13 13:11:13,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 13:11:13,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:11:13,193 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:11:13,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 13:11:13,194 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting insertionSortErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:11:13,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:11:13,194 INFO L85 PathProgramCache]: Analyzing trace with hash 53763351, now seen corresponding path program 2 times [2024-10-13 13:11:13,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:11:13,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317541229] [2024-10-13 13:11:13,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:11:13,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:11:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:11:13,422 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 13:11:13,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:11:13,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317541229] [2024-10-13 13:11:13,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317541229] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:11:13,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077499893] [2024-10-13 13:11:13,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 13:11:13,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:11:13,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:11:13,425 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) [2024-10-13 13:11:13,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 13:11:13,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 13:11:13,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:11:13,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 13:11:13,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:11:13,609 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-13 13:11:13,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:11:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-13 13:11:13,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077499893] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:11:13,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:11:13,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 18 [2024-10-13 13:11:13,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101598457] [2024-10-13 13:11:13,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:11:13,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 13:11:13,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:11:13,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 13:11:13,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-10-13 13:11:13,718 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 18 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:14,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:11:14,023 INFO L93 Difference]: Finished difference Result 153 states and 174 transitions. [2024-10-13 13:11:14,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 13:11:14,024 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-10-13 13:11:14,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:11:14,025 INFO L225 Difference]: With dead ends: 153 [2024-10-13 13:11:14,025 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 13:11:14,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2024-10-13 13:11:14,026 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 89 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:11:14,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 159 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:11:14,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 13:11:14,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2024-10-13 13:11:14,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 69 states have internal predecessors, (77), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2024-10-13 13:11:14,034 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 45 [2024-10-13 13:11:14,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:11:14,035 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2024-10-13 13:11:14,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:14,035 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2024-10-13 13:11:14,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-13 13:11:14,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:11:14,036 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:11:14,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 13:11:14,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:11:14,237 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting insertionSortErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-13 13:11:14,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:11:14,238 INFO L85 PathProgramCache]: Analyzing trace with hash 669016840, now seen corresponding path program 3 times [2024-10-13 13:11:14,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:11:14,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902131872] [2024-10-13 13:11:14,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:11:14,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:11:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:11:14,583 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 39 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 13:11:14,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:11:14,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902131872] [2024-10-13 13:11:14,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902131872] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:11:14,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609747101] [2024-10-13 13:11:14,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 13:11:14,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:11:14,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:11:14,586 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:11:14,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 13:11:14,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-13 13:11:14,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:11:14,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 13:11:14,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:11:14,794 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 13:11:14,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:11:14,986 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 13:11:14,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609747101] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:11:14,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:11:14,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 4, 4] total 20 [2024-10-13 13:11:14,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446678767] [2024-10-13 13:11:14,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:11:14,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-13 13:11:14,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:11:14,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-13 13:11:14,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2024-10-13 13:11:14,990 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 20 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 16 states have internal predecessors, (68), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:11:15,317 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2024-10-13 13:11:15,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 13:11:15,317 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 16 states have internal predecessors, (68), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-13 13:11:15,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:11:15,318 INFO L225 Difference]: With dead ends: 141 [2024-10-13 13:11:15,318 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 13:11:15,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 91 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=1038, Unknown=0, NotChecked=0, Total=1190 [2024-10-13 13:11:15,322 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 76 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:11:15,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 229 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:11:15,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 13:11:15,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 13:11:15,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2024-10-13 13:11:15,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 13:11:15,323 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2024-10-13 13:11:15,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:11:15,323 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 13:11:15,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 16 states have internal predecessors, (68), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:11:15,324 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 13:11:15,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 13:11:15,327 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2024-10-13 13:11:15,328 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2024-10-13 13:11:15,328 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2024-10-13 13:11:15,328 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2024-10-13 13:11:15,328 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2024-10-13 13:11:15,328 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2024-10-13 13:11:15,328 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2024-10-13 13:11:15,329 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2024-10-13 13:11:15,329 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2024-10-13 13:11:15,329 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2024-10-13 13:11:15,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 13:11:15,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-13 13:11:15,533 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:11:15,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 13:11:16,463 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 13:11:16,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:11:16 BoogieIcfgContainer [2024-10-13 13:11:16,481 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 13:11:16,481 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 13:11:16,482 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 13:11:16,482 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 13:11:16,482 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:11:08" (3/4) ... [2024-10-13 13:11:16,484 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 13:11:16,489 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure insertionSort [2024-10-13 13:11:16,494 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-13 13:11:16,495 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 13:11:16,495 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-13 13:11:16,495 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 13:11:16,521 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\old(i) != 0) || (2 < \old(size))) || (size <= 2)) && ((((size <= 2147483647) && (j == 0)) && (i == 0)) || (\old(i) != 0))) && (((((1 <= i) && (size <= 2147483647)) && (i <= 2147483646)) && (j <= 2147483647)) || (\old(i) < 1))) && (((i == 1) || (\old(i) < 1)) || (1 < \old(i)))) && ((((\old(i) <= 2147483647) && (1 <= \old(i))) && (\old(size) <= 2147483647)) || ((\old(i) == 0) && (\old(size) <= 2147483647)))) && (((((long) \old(i) + 1) < \old(size)) || (size <= ((long) i + 1))) || (1 < \old(i)))) && (((\old(i) < \old(size)) || (\old(i) < 1)) || (2147483647 <= \old(i)))) [2024-10-13 13:11:16,534 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\old(i) != 0) || (2 < \old(size))) || (size <= 2)) && ((((size <= 2147483647) && (j == 0)) && (i == 0)) || (\old(i) != 0))) && (((((1 <= i) && (size <= 2147483647)) && (i <= 2147483646)) && (j <= 2147483647)) || (\old(i) < 1))) && (((i == 1) || (\old(i) < 1)) || (1 < \old(i)))) && ((((\old(i) <= 2147483647) && (1 <= \old(i))) && (\old(size) <= 2147483647)) || ((\old(i) == 0) && (\old(size) <= 2147483647)))) && (((((long) \old(i) + 1) < \old(size)) || (size <= ((long) i + 1))) || (1 < \old(i)))) && (((\old(i) < \old(size)) || (\old(i) < 1)) || (2147483647 <= \old(i)))) [2024-10-13 13:11:16,577 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 13:11:16,577 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 13:11:16,577 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 13:11:16,579 INFO L158 Benchmark]: Toolchain (without parser) took 9009.82ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 121.8MB in the beginning and 81.6MB in the end (delta: 40.3MB). Peak memory consumption was 78.6MB. Max. memory is 16.1GB. [2024-10-13 13:11:16,579 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:11:16,579 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.02ms. Allocated memory is still 151.0MB. Free memory was 121.8MB in the beginning and 109.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 13:11:16,580 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.18ms. Allocated memory is still 151.0MB. Free memory was 109.6MB in the beginning and 108.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:11:16,580 INFO L158 Benchmark]: Boogie Preprocessor took 59.65ms. Allocated memory is still 151.0MB. Free memory was 108.2MB in the beginning and 106.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:11:16,580 INFO L158 Benchmark]: RCFGBuilder took 388.56ms. Allocated memory is still 151.0MB. Free memory was 106.1MB in the beginning and 92.5MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 13:11:16,580 INFO L158 Benchmark]: TraceAbstraction took 8162.20ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 92.0MB in the beginning and 86.8MB in the end (delta: 5.2MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. [2024-10-13 13:11:16,581 INFO L158 Benchmark]: Witness Printer took 96.01ms. Allocated memory is still 188.7MB. Free memory was 86.8MB in the beginning and 81.6MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 13:11:16,584 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.02ms. Allocated memory is still 151.0MB. Free memory was 121.8MB in the beginning and 109.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.18ms. Allocated memory is still 151.0MB. Free memory was 109.6MB in the beginning and 108.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.65ms. Allocated memory is still 151.0MB. Free memory was 108.2MB in the beginning and 106.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 388.56ms. Allocated memory is still 151.0MB. Free memory was 106.1MB in the beginning and 92.5MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8162.20ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 92.0MB in the beginning and 86.8MB in the end (delta: 5.2MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. * Witness Printer took 96.01ms. Allocated memory is still 188.7MB. Free memory was 86.8MB in the beginning and 81.6MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 438 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 438 mSDsluCounter, 1706 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1315 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1145 IncrementalHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 391 mSDtfsCounter, 1145 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 495 GetRequests, 313 SyntacticMatches, 16 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=16, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 91 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 569 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 688 ConstructedInterpolants, 0 QuantifiedInterpolants, 1577 SizeOfPredicates, 17 NumberOfNonLiveVariables, 825 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 30 InterpolantComputations, 12 PerfectInterpolantSequences, 369/527 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 - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((n <= 2147483647) && (1 <= i)) || (((n <= 2147483647) && (i == 0)) && (1 <= n))) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (((((((((\old(i) != 0) || (2 < \old(size))) || (size <= 2)) && ((((size <= 2147483647) && (j == 0)) && (i == 0)) || (\old(i) != 0))) && (((((1 <= i) && (size <= 2147483647)) && (i <= 2147483646)) && (j <= 2147483647)) || (\old(i) < 1))) && (((i == 1) || (\old(i) < 1)) || (1 < \old(i)))) && ((((\old(i) <= 2147483647) && (1 <= \old(i))) && (\old(size) <= 2147483647)) || ((\old(i) == 0) && (\old(size) <= 2147483647)))) && (((((long) \old(i) + 1) < \old(size)) || (size <= ((long) i + 1))) || (1 < \old(i)))) && (((\old(i) < \old(size)) || (\old(i) < 1)) || (2147483647 <= \old(i)))) - ProcedureContractResult [Line: 8]: Procedure Contract for insertionSort Derived contract for procedure insertionSort. Requires: ((((i <= 2147483647) && (1 <= i)) && (size <= 2147483647)) || ((i == 0) && (size <= 2147483647))) Ensures: ((((i <= 2147483647) && (1 <= i)) && (size <= 2147483647)) || ((i == 0) && (size <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2024-10-13 13:11:16,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE