./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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/loop-zilu/benchmark23_conjunctive.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8661b1e533413e4de6576c4feab251d05a672526bd5f59b260c6cb9f9c05939 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:09:15,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:09:15,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:09:15,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:09:15,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:09:15,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:09:15,805 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:09:15,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:09:15,806 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:09:15,808 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:09:15,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:09:15,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:09:15,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:09:15,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:09:15,810 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:09:15,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:09:15,814 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:09:15,814 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:09:15,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:09:15,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:09:15,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:09:15,816 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:09:15,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:09:15,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:09:15,816 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:09:15,816 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:09:15,817 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:09:15,817 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:09:15,817 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:09:15,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:09:15,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:09:15,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:09:15,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:09:15,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:09:15,819 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:09:15,822 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:09:15,822 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:09:15,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:09:15,823 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:09:15,823 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:09:15,823 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:09:15,823 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:09:15,823 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8661b1e533413e4de6576c4feab251d05a672526bd5f59b260c6cb9f9c05939 [2024-10-14 02:09:16,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:09:16,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:09:16,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:09:16,085 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:09:16,086 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:09:16,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i [2024-10-14 02:09:17,518 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:09:17,723 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:09:17,724 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i [2024-10-14 02:09:17,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3aafd3aad/27277c3deb8b41f88508d486c784a14c/FLAG164d3a476 [2024-10-14 02:09:18,098 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3aafd3aad/27277c3deb8b41f88508d486c784a14c [2024-10-14 02:09:18,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:09:18,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:09:18,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:09:18,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:09:18,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:09:18,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:09:18" (1/1) ... [2024-10-14 02:09:18,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e433ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:18, skipping insertion in model container [2024-10-14 02:09:18,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:09:18" (1/1) ... [2024-10-14 02:09:18,144 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:09:18,303 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i[873,886] [2024-10-14 02:09:18,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:09:18,333 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:09:18,367 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i[873,886] [2024-10-14 02:09:18,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:09:18,386 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:09:18,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:18 WrapperNode [2024-10-14 02:09:18,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:09:18,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:09:18,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:09:18,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:09:18,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:18" (1/1) ... [2024-10-14 02:09:18,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:18" (1/1) ... [2024-10-14 02:09:18,418 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2024-10-14 02:09:18,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:09:18,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:09:18,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:09:18,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:09:18,428 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:18" (1/1) ... [2024-10-14 02:09:18,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:18" (1/1) ... [2024-10-14 02:09:18,429 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:18" (1/1) ... [2024-10-14 02:09:18,440 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 02:09:18,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:18" (1/1) ... [2024-10-14 02:09:18,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:18" (1/1) ... [2024-10-14 02:09:18,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:18" (1/1) ... [2024-10-14 02:09:18,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:18" (1/1) ... [2024-10-14 02:09:18,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:18" (1/1) ... [2024-10-14 02:09:18,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:18" (1/1) ... [2024-10-14 02:09:18,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:09:18,448 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:09:18,448 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:09:18,449 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:09:18,449 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:18" (1/1) ... [2024-10-14 02:09:18,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:09:18,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:09:18,487 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-14 02:09:18,490 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-14 02:09:18,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:09:18,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:09:18,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:09:18,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:09:18,605 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:09:18,608 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:09:18,739 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-14 02:09:18,739 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:09:18,771 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:09:18,771 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 02:09:18,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:09:18 BoogieIcfgContainer [2024-10-14 02:09:18,772 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:09:18,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:09:18,774 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:09:18,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:09:18,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:09:18" (1/3) ... [2024-10-14 02:09:18,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400f5b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:09:18, skipping insertion in model container [2024-10-14 02:09:18,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:18" (2/3) ... [2024-10-14 02:09:18,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400f5b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:09:18, skipping insertion in model container [2024-10-14 02:09:18,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:09:18" (3/3) ... [2024-10-14 02:09:18,782 INFO L112 eAbstractionObserver]: Analyzing ICFG benchmark23_conjunctive.i [2024-10-14 02:09:18,802 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:09:18,803 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:09:18,878 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:09:18,887 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;@5c4c7050, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:09:18,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:09:18,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 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-14 02:09:18,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 02:09:18,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:09:18,898 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 02:09:18,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:09:18,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:09:18,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1839286506, now seen corresponding path program 1 times [2024-10-14 02:09:18,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:09:18,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851313586] [2024-10-14 02:09:18,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:09:18,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:09:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:09:19,034 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-14 02:09:19,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:09:19,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851313586] [2024-10-14 02:09:19,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851313586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:09:19,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:09:19,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 02:09:19,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909895550] [2024-10-14 02:09:19,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:09:19,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 02:09:19,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:09:19,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 02:09:19,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 02:09:19,075 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-14 02:09:19,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:09:19,101 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2024-10-14 02:09:19,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 02:09:19,107 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2024-10-14 02:09:19,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:09:19,122 INFO L225 Difference]: With dead ends: 17 [2024-10-14 02:09:19,122 INFO L226 Difference]: Without dead ends: 7 [2024-10-14 02:09:19,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 02:09:19,132 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:09:19,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:09:19,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2024-10-14 02:09:19,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2024-10-14 02:09:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) 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-14 02:09:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2024-10-14 02:09:19,162 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 6 [2024-10-14 02:09:19,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:09:19,162 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2024-10-14 02:09:19,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-14 02:09:19,162 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2024-10-14 02:09:19,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 02:09:19,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:09:19,163 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 02:09:19,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 02:09:19,163 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:09:19,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:09:19,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1839167342, now seen corresponding path program 1 times [2024-10-14 02:09:19,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:09:19,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239428272] [2024-10-14 02:09:19,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:09:19,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:09:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:09:19,249 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-14 02:09:19,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:09:19,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239428272] [2024-10-14 02:09:19,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239428272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:09:19,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:09:19,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 02:09:19,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920035405] [2024-10-14 02:09:19,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:09:19,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 02:09:19,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:09:19,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 02:09:19,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 02:09:19,253 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-14 02:09:19,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:09:19,263 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2024-10-14 02:09:19,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 02:09:19,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-10-14 02:09:19,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:09:19,264 INFO L225 Difference]: With dead ends: 12 [2024-10-14 02:09:19,264 INFO L226 Difference]: Without dead ends: 8 [2024-10-14 02:09:19,265 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-14 02:09:19,266 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:09:19,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:09:19,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-10-14 02:09:19,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-10-14 02:09:19,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-14 02:09:19,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-14 02:09:19,270 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2024-10-14 02:09:19,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:09:19,270 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-14 02:09:19,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-14 02:09:19,270 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-14 02:09:19,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 02:09:19,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:09:19,271 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:09:19,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 02:09:19,271 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:09:19,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:09:19,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1181278160, now seen corresponding path program 1 times [2024-10-14 02:09:19,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:09:19,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974626907] [2024-10-14 02:09:19,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:09:19,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:09:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:09:19,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:09:19,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:09:19,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974626907] [2024-10-14 02:09:19,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974626907] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:09:19,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400777844] [2024-10-14 02:09:19,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:09:19,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:09:19,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:09:19,376 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-14 02:09:19,378 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-14 02:09:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:09:19,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 02:09:19,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:09:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:09:19,467 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:09:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:09:19,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400777844] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:09:19,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:09:19,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-14 02:09:19,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466426006] [2024-10-14 02:09:19,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:09:19,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:09:19,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:09:19,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:09:19,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:09:19,512 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-14 02:09:19,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:09:19,534 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2024-10-14 02:09:19,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:09:19,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-14 02:09:19,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:09:19,536 INFO L225 Difference]: With dead ends: 15 [2024-10-14 02:09:19,537 INFO L226 Difference]: Without dead ends: 11 [2024-10-14 02:09:19,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:09:19,539 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:09:19,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:09:19,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-14 02:09:19,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-14 02:09:19,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-14 02:09:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-14 02:09:19,543 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-14 02:09:19,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:09:19,546 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-14 02:09:19,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-14 02:09:19,547 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-14 02:09:19,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 02:09:19,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:09:19,547 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2024-10-14 02:09:19,567 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-14 02:09:19,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:09:19,748 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:09:19,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:09:19,749 INFO L85 PathProgramCache]: Analyzing trace with hash 149389294, now seen corresponding path program 2 times [2024-10-14 02:09:19,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:09:19,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325571361] [2024-10-14 02:09:19,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:09:19,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:09:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:09:19,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:09:19,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:09:19,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325571361] [2024-10-14 02:09:19,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325571361] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:09:19,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654630530] [2024-10-14 02:09:19,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 02:09:19,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:09:19,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:09:19,919 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-14 02:09:19,920 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-14 02:09:19,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 02:09:19,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 02:09:19,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 02:09:19,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:09:19,995 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:09:19,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:09:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:09:20,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654630530] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:09:20,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:09:20,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-10-14 02:09:20,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780585034] [2024-10-14 02:09:20,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:09:20,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 02:09:20,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:09:20,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 02:09:20,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:09:20,109 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-14 02:09:20,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:09:20,142 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2024-10-14 02:09:20,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 02:09:20,142 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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 10 [2024-10-14 02:09:20,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:09:20,143 INFO L225 Difference]: With dead ends: 21 [2024-10-14 02:09:20,143 INFO L226 Difference]: Without dead ends: 17 [2024-10-14 02:09:20,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:09:20,145 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:09:20,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:09:20,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-14 02:09:20,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-14 02:09:20,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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-14 02:09:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2024-10-14 02:09:20,150 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2024-10-14 02:09:20,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:09:20,150 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2024-10-14 02:09:20,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-14 02:09:20,150 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2024-10-14 02:09:20,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 02:09:20,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:09:20,151 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2024-10-14 02:09:20,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 02:09:20,351 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,SelfDestructingSolverStorable3 [2024-10-14 02:09:20,352 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:09:20,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:09:20,353 INFO L85 PathProgramCache]: Analyzing trace with hash 443815086, now seen corresponding path program 3 times [2024-10-14 02:09:20,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:09:20,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036287800] [2024-10-14 02:09:20,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:09:20,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:09:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:09:20,576 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:09:20,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:09:20,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036287800] [2024-10-14 02:09:20,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036287800] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:09:20,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389125962] [2024-10-14 02:09:20,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 02:09:20,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:09:20,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:09:20,579 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-14 02:09:20,584 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-14 02:09:20,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-14 02:09:20,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 02:09:20,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 02:09:20,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:09:20,683 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:09:20,684 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:09:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:09:20,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389125962] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:09:20,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:09:20,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2024-10-14 02:09:20,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720852217] [2024-10-14 02:09:20,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:09:20,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 02:09:20,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:09:20,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 02:09:20,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-10-14 02:09:20,973 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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-14 02:09:21,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:09:21,018 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2024-10-14 02:09:21,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 02:09:21,019 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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 16 [2024-10-14 02:09:21,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:09:21,019 INFO L225 Difference]: With dead ends: 33 [2024-10-14 02:09:21,019 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 02:09:21,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-10-14 02:09:21,021 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 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-14 02:09:21,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:09:21,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 02:09:21,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-14 02:09:21,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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-14 02:09:21,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2024-10-14 02:09:21,032 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 16 [2024-10-14 02:09:21,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:09:21,032 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2024-10-14 02:09:21,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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-14 02:09:21,033 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2024-10-14 02:09:21,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 02:09:21,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:09:21,033 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1] [2024-10-14 02:09:21,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 02:09:21,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:09:21,235 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:09:21,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:09:21,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1535217198, now seen corresponding path program 4 times [2024-10-14 02:09:21,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:09:21,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122164009] [2024-10-14 02:09:21,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:09:21,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:09:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:09:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:09:21,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:09:21,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122164009] [2024-10-14 02:09:21,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122164009] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:09:21,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353570080] [2024-10-14 02:09:21,838 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 02:09:21,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:09:21,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:09:21,840 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-14 02:09:21,842 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-14 02:09:21,900 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 02:09:21,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 02:09:21,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-14 02:09:21,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:09:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:09:21,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:09:22,799 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:09:22,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353570080] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:09:22,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:09:22,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2024-10-14 02:09:22,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780610399] [2024-10-14 02:09:22,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:09:22,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-14 02:09:22,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:09:22,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-14 02:09:22,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-10-14 02:09:22,807 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 48 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 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-14 02:09:22,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:09:22,892 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2024-10-14 02:09:22,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-14 02:09:22,893 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 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 28 [2024-10-14 02:09:22,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:09:22,894 INFO L225 Difference]: With dead ends: 57 [2024-10-14 02:09:22,895 INFO L226 Difference]: Without dead ends: 53 [2024-10-14 02:09:22,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-10-14 02:09:22,898 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:09:22,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:09:22,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-14 02:09:22,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-14 02:09:22,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:09:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2024-10-14 02:09:22,906 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 28 [2024-10-14 02:09:22,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:09:22,906 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2024-10-14 02:09:22,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 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-14 02:09:22,907 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2024-10-14 02:09:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 02:09:22,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:09:22,908 INFO L215 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1] [2024-10-14 02:09:22,921 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-14 02:09:23,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:09:23,110 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:09:23,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:09:23,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1220689618, now seen corresponding path program 5 times [2024-10-14 02:09:23,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:09:23,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498781652] [2024-10-14 02:09:23,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:09:23,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:09:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:09:24,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:09:24,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:09:24,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498781652] [2024-10-14 02:09:24,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498781652] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:09:24,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295855303] [2024-10-14 02:09:24,671 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 02:09:24,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:09:24,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:09:24,672 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-14 02:09:24,673 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-14 02:09:24,764 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2024-10-14 02:09:24,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 02:09:24,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-14 02:09:24,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:09:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:09:24,867 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:09:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:09:27,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295855303] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:09:27,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:09:27,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 96 [2024-10-14 02:09:27,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017121971] [2024-10-14 02:09:27,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:09:27,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2024-10-14 02:09:27,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:09:27,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-10-14 02:09:27,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-10-14 02:09:27,468 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 96 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 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-14 02:09:27,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:09:27,595 INFO L93 Difference]: Finished difference Result 105 states and 152 transitions. [2024-10-14 02:09:27,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-10-14 02:09:27,595 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 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 52 [2024-10-14 02:09:27,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:09:27,597 INFO L225 Difference]: With dead ends: 105 [2024-10-14 02:09:27,597 INFO L226 Difference]: Without dead ends: 101 [2024-10-14 02:09:27,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-10-14 02:09:27,600 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:09:27,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:09:27,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-14 02:09:27,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-14 02:09:27,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 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-14 02:09:27,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2024-10-14 02:09:27,618 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 52 [2024-10-14 02:09:27,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:09:27,619 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2024-10-14 02:09:27,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 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-14 02:09:27,619 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2024-10-14 02:09:27,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 02:09:27,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:09:27,625 INFO L215 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1] [2024-10-14 02:09:27,647 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-14 02:09:27,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:09:27,831 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:09:27,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:09:27,831 INFO L85 PathProgramCache]: Analyzing trace with hash 465250094, now seen corresponding path program 6 times [2024-10-14 02:09:27,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:09:27,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054900022] [2024-10-14 02:09:27,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:09:27,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:09:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:09:32,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:09:32,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:09:32,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054900022] [2024-10-14 02:09:32,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054900022] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:09:32,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882019761] [2024-10-14 02:09:32,755 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-14 02:09:32,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:09:32,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:09:32,756 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-14 02:09:32,757 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-14 02:09:32,907 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2024-10-14 02:09:32,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 02:09:32,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-10-14 02:09:32,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:09:33,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:09:33,089 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:09:36,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:09:36,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882019761] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:09:36,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:09:36,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 102 [2024-10-14 02:09:36,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175395750] [2024-10-14 02:09:36,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:09:36,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-14 02:09:36,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:09:36,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-14 02:09:36,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2024-10-14 02:09:36,751 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand has 102 states, 102 states have (on average 1.0490196078431373) internal successors, (107), 102 states have internal predecessors, (107), 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-14 02:09:36,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:09:36,881 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2024-10-14 02:09:36,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-10-14 02:09:36,883 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 1.0490196078431373) internal successors, (107), 102 states have internal predecessors, (107), 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 100 [2024-10-14 02:09:36,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:09:36,886 INFO L225 Difference]: With dead ends: 111 [2024-10-14 02:09:36,887 INFO L226 Difference]: Without dead ends: 107 [2024-10-14 02:09:36,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 105 SyntacticMatches, 90 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4455 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2024-10-14 02:09:36,891 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:09:36,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:09:36,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-14 02:09:36,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-14 02:09:36,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.009433962264151) internal successors, (107), 106 states have internal predecessors, (107), 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-14 02:09:36,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2024-10-14 02:09:36,907 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 100 [2024-10-14 02:09:36,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:09:36,907 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2024-10-14 02:09:36,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 1.0490196078431373) internal successors, (107), 102 states have internal predecessors, (107), 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-14 02:09:36,908 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2024-10-14 02:09:36,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-14 02:09:36,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:09:36,909 INFO L215 NwaCegarLoop]: trace histogram [100, 1, 1, 1, 1, 1, 1] [2024-10-14 02:09:36,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-14 02:09:37,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:09:37,114 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:09:37,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:09:37,114 INFO L85 PathProgramCache]: Analyzing trace with hash -314749970, now seen corresponding path program 7 times [2024-10-14 02:09:37,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:09:37,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633106739] [2024-10-14 02:09:37,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:09:37,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:09:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:09:42,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:09:42,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:09:42,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633106739] [2024-10-14 02:09:42,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633106739] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:09:42,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128677970] [2024-10-14 02:09:42,272 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-14 02:09:42,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:09:42,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:09:42,273 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-14 02:09:42,274 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-14 02:09:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:09:42,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 205 conjuncts are in the unsatisfiable core [2024-10-14 02:09:42,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:09:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:09:42,711 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:09:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:09:42,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128677970] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:09:42,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:09:42,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 105 [2024-10-14 02:09:42,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39998554] [2024-10-14 02:09:42,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:09:42,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2024-10-14 02:09:42,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:09:42,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2024-10-14 02:09:42,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=10712, Unknown=0, NotChecked=0, Total=10920 [2024-10-14 02:09:42,958 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand has 105 states, 105 states have (on average 1.0285714285714285) internal successors, (108), 105 states have internal predecessors, (108), 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-14 02:09:46,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:09:46,490 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2024-10-14 02:09:46,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-10-14 02:09:46,491 INFO L78 Accepts]: Start accepts. Automaton has has 105 states, 105 states have (on average 1.0285714285714285) internal successors, (108), 105 states have internal predecessors, (108), 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 106 [2024-10-14 02:09:46,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:09:46,493 INFO L225 Difference]: With dead ends: 112 [2024-10-14 02:09:46,493 INFO L226 Difference]: Without dead ends: 108 [2024-10-14 02:09:46,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=208, Invalid=10712, Unknown=0, NotChecked=0, Total=10920 [2024-10-14 02:09:46,496 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 10610 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 10610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:09:46,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 310 Invalid, 10610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10610 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-14 02:09:46,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-14 02:09:46,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-14 02:09:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.0093457943925233) internal successors, (108), 107 states have internal predecessors, (108), 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-14 02:09:46,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2024-10-14 02:09:46,506 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2024-10-14 02:09:46,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:09:46,507 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2024-10-14 02:09:46,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 1.0285714285714285) internal successors, (108), 105 states have internal predecessors, (108), 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-14 02:09:46,507 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2024-10-14 02:09:46,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 02:09:46,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:09:46,508 INFO L215 NwaCegarLoop]: trace histogram [101, 1, 1, 1, 1, 1, 1] [2024-10-14 02:09:46,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-14 02:09:46,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:09:46,709 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:09:46,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:09:46,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1165649072, now seen corresponding path program 8 times [2024-10-14 02:09:46,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:09:46,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416412911] [2024-10-14 02:09:46,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:09:46,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:09:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:09:51,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 5151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:09:51,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:09:51,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416412911] [2024-10-14 02:09:51,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416412911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:09:51,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:09:51,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [103] imperfect sequences [] total 103 [2024-10-14 02:09:51,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390666170] [2024-10-14 02:09:51,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:09:51,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2024-10-14 02:09:51,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:09:51,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2024-10-14 02:09:51,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2024-10-14 02:09:51,340 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand has 103 states, 103 states have (on average 1.0388349514563107) internal successors, (107), 103 states have internal predecessors, (107), 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-14 02:09:51,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:09:51,601 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2024-10-14 02:09:51,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2024-10-14 02:09:51,602 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 1.0388349514563107) internal successors, (107), 103 states have internal predecessors, (107), 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 107 [2024-10-14 02:09:51,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:09:51,602 INFO L225 Difference]: With dead ends: 108 [2024-10-14 02:09:51,602 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 02:09:51,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2024-10-14 02:09:51,604 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:09:51,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 02:09:51,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 02:09:51,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 02:09:51,605 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-14 02:09:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 02:09:51,605 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2024-10-14 02:09:51,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:09:51,605 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 02:09:51,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 1.0388349514563107) internal successors, (107), 103 states have internal predecessors, (107), 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-14 02:09:51,606 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 02:09:51,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 02:09:51,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 02:09:51,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 02:09:51,610 INFO L407 BasicCegarLoop]: Path program histogram: [8, 1, 1] [2024-10-14 02:09:51,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 02:09:52,806 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 02:09:52,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:09:52 BoogieIcfgContainer [2024-10-14 02:09:52,857 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 02:09:52,858 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 02:09:52,858 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 02:09:52,858 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 02:09:52,858 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:09:18" (3/4) ... [2024-10-14 02:09:52,864 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 02:09:52,871 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-10-14 02:09:52,872 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-14 02:09:52,872 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 02:09:52,873 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 02:09:52,958 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 02:09:52,961 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 02:09:52,961 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 02:09:52,962 INFO L158 Benchmark]: Toolchain (without parser) took 34860.12ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 99.9MB in the beginning and 228.6MB in the end (delta: -128.7MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. [2024-10-14 02:09:52,962 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 02:09:52,962 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.53ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 138.2MB in the end (delta: -38.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 02:09:52,963 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.09ms. Allocated memory is still 167.8MB. Free memory was 138.2MB in the beginning and 136.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 02:09:52,963 INFO L158 Benchmark]: Boogie Preprocessor took 28.56ms. Allocated memory is still 167.8MB. Free memory was 136.6MB in the beginning and 135.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 02:09:52,963 INFO L158 Benchmark]: RCFGBuilder took 323.61ms. Allocated memory is still 167.8MB. Free memory was 135.1MB in the beginning and 124.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 02:09:52,963 INFO L158 Benchmark]: TraceAbstraction took 34083.49ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 124.0MB in the beginning and 232.8MB in the end (delta: -108.9MB). Peak memory consumption was 198.8MB. Max. memory is 16.1GB. [2024-10-14 02:09:52,964 INFO L158 Benchmark]: Witness Printer took 103.81ms. Allocated memory is still 352.3MB. Free memory was 232.8MB in the beginning and 228.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 02:09:52,966 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.15ms. Allocated memory is still 104.9MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.53ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 138.2MB in the end (delta: -38.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.09ms. Allocated memory is still 167.8MB. Free memory was 138.2MB in the beginning and 136.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.56ms. Allocated memory is still 167.8MB. Free memory was 136.6MB in the beginning and 135.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 323.61ms. Allocated memory is still 167.8MB. Free memory was 135.1MB in the beginning and 124.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 34083.49ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 124.0MB in the beginning and 232.8MB in the end (delta: -108.9MB). Peak memory consumption was 198.8MB. Max. memory is 16.1GB. * Witness Printer took 103.81ms. Allocated memory is still 352.3MB. Free memory was 232.8MB in the beginning and 228.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 16]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.8s, OverallIterations: 10, TraceHistogramMax: 101, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 433 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 384 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11487 IncrementalHoareTripleChecker+Invalid, 11492 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 49 mSDtfsCounter, 11487 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1031 GetRequests, 459 SyntacticMatches, 91 SemanticMatches, 481 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4455 ImplicationChecksByTransitivity, 18.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=9, InterpolantAutomatonStates: 500, 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, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 25.5s InterpolantComputationTime, 757 NumberOfCodeBlocks, 757 NumberOfCodeBlocksAsserted, 94 NumberOfCheckSat, 1052 ConstructedInterpolants, 0 QuantifiedInterpolants, 2973 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1616 ConjunctsInSsa, 394 ConjunctsInUnsatCore, 24 InterpolantComputations, 3 PerfectInterpolantSequences, 5151/37896 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 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((j == 124) && (62 == i)) || ((i == 11) && (22 == j))) || ((76 == j) && (i == 38))) || ((41 == i) && (82 == j))) || ((94 == i) && (j == 188))) || ((i == 15) && (30 == j))) || ((i == 63) && (j == 126))) || ((23 == i) && (46 == j))) || ((j == 80) && (40 == i))) || ((134 == j) && (67 == i))) || ((154 == j) && (77 == i))) || ((9 == i) && (j == 18))) || ((i == 4) && (j == 8))) || ((j == 166) && (i == 83))) || ((j == 12) && (6 == i))) || ((88 == i) && (176 == j))) || ((88 == j) && (44 == i))) || ((i == 26) && (52 == j))) || ((i == 39) && (j == 78))) || ((68 == j) && (i == 34))) || ((7 == i) && (14 == j))) || ((32 == j) && (16 == i))) || ((i == 93) && (j == 186))) || ((j == 180) && (i == 90))) || ((j == 26) && (i == 13))) || ((42 == i) && (84 == j))) || ((j == 38) && (19 == i))) || ((68 == i) && (j == 136))) || ((40 == j) && (i == 20))) || ((71 == i) && (142 == j))) || ((i == 8) && (16 == j))) || ((100 <= i) && (200 == j))) || ((56 == i) && (112 == j))) || ((2 == j) && (i == 1))) || ((91 == i) && (j == 182))) || ((156 == j) && (i == 78))) || ((35 == i) && (j == 70))) || ((j == 100) && (i == 50))) || ((j == 50) && (i == 25))) || ((i == 0) && (j == 0))) || ((j == 198) && (i == 99))) || ((108 == j) && (i == 54))) || ((i == 96) && (192 == j))) || ((j == 90) && (i == 45))) || ((144 == j) && (72 == i))) || ((57 == i) && (j == 114))) || ((i == 80) && (160 == j))) || ((i == 79) && (158 == j))) || ((190 == j) && (95 == i))) || ((i == 43) && (j == 86))) || ((j == 60) && (30 == i))) || ((46 == i) && (92 == j))) || ((106 == j) && (53 == i))) || ((i == 33) && (66 == j))) || ((i == 86) && (j == 172))) || ((64 == j) && (32 == i))) || ((i == 60) && (j == 120))) || ((5 == i) && (j == 10))) || ((j == 162) && (81 == i))) || ((29 == i) && (j == 58))) || ((14 == i) && (j == 28))) || ((94 == j) && (47 == i))) || ((i == 28) && (56 == j))) || ((62 == j) && (31 == i))) || ((194 == j) && (97 == i))) || ((i == 55) && (110 == j))) || ((j == 54) && (i == 27))) || ((j == 102) && (51 == i))) || ((164 == j) && (82 == i))) || ((138 == j) && (69 == i))) || ((64 == i) && (j == 128))) || ((j == 130) && (i == 65))) || ((i == 61) && (j == 122))) || ((6 == j) && (3 == i))) || ((104 == j) && (52 == i))) || ((98 == j) && (49 == i))) || ((j == 36) && (i == 18))) || ((196 == j) && (98 == i))) || ((i == 85) && (170 == j))) || ((i == 24) && (j == 48))) || ((152 == j) && (76 == i))) || ((i == 17) && (j == 34))) || ((j == 20) && (i == 10))) || ((66 == i) && (j == 132))) || ((i == 12) && (j == 24))) || ((j == 168) && (84 == i))) || ((i == 70) && (140 == j))) || ((92 == i) && (184 == j))) || ((j == 96) && (i == 48))) || ((j == 4) && (2 == i))) || ((21 == i) && (42 == j))) || ((22 == i) && (44 == j))) || ((146 == j) && (i == 73))) || ((116 == j) && (i == 58))) || ((178 == j) && (89 == i))) || ((i == 37) && (j == 74))) || ((i == 75) && (j == 150))) || ((i == 74) && (148 == j))) || ((i == 36) && (72 == j))) || ((87 == i) && (j == 174))) || ((j == 118) && (59 == i))) RESULT: Ultimate proved your program to be correct! [2024-10-14 02:09:52,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE