./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label38.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label38.c -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 7493d306d44d9507b84459ae39e255658015ac06dd9b543cde90600f3bafda06 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:00:42,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:00:42,941 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:00:42,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:00:42,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:00:42,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:00:42,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:00:42,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:00:42,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:00:42,972 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:00:42,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:00:42,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:00:42,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:00:42,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:00:42,975 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:00:42,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:00:42,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:00:42,976 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:00:42,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:00:42,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:00:42,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:00:42,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:00:42,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:00:42,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:00:42,980 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:00:42,980 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:00:42,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:00:42,980 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:00:42,980 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:00:42,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:00:42,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:00:42,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:00:42,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:00:42,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:00:42,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:00:42,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:00:42,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:00:42,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:00:42,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:00:42,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:00:42,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:00:42,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:00:42,984 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 -> 7493d306d44d9507b84459ae39e255658015ac06dd9b543cde90600f3bafda06 [2024-10-12 16:00:43,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:00:43,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:00:43,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:00:43,224 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:00:43,224 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:00:43,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label38.c [2024-10-12 16:00:44,549 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:00:44,814 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:00:44,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label38.c [2024-10-12 16:00:44,830 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70558e9e9/38f10d6d7957466a99a2d0fbdb771ecf/FLAGad0de1a19 [2024-10-12 16:00:45,109 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70558e9e9/38f10d6d7957466a99a2d0fbdb771ecf [2024-10-12 16:00:45,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:00:45,112 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:00:45,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:00:45,113 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:00:45,122 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:00:45,122 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:00:45" (1/1) ... [2024-10-12 16:00:45,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a266981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:00:45, skipping insertion in model container [2024-10-12 16:00:45,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:00:45" (1/1) ... [2024-10-12 16:00:45,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:00:45,365 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/eca-rers2012/Problem11_label38.c[8652,8665] [2024-10-12 16:00:45,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:00:45,521 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:00:45,544 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/eca-rers2012/Problem11_label38.c[8652,8665] [2024-10-12 16:00:45,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:00:45,679 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:00:45,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:00:45 WrapperNode [2024-10-12 16:00:45,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:00:45,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:00:45,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:00:45,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:00:45,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:00:45" (1/1) ... [2024-10-12 16:00:45,705 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:00:45" (1/1) ... [2024-10-12 16:00:45,784 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-10-12 16:00:45,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:00:45,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:00:45,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:00:45,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:00:45,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:00:45" (1/1) ... [2024-10-12 16:00:45,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:00:45" (1/1) ... [2024-10-12 16:00:45,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:00:45" (1/1) ... [2024-10-12 16:00:45,910 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-12 16:00:45,910 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:00:45" (1/1) ... [2024-10-12 16:00:45,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:00:45" (1/1) ... [2024-10-12 16:00:45,963 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:00:45" (1/1) ... [2024-10-12 16:00:45,973 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:00:45" (1/1) ... [2024-10-12 16:00:45,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:00:45" (1/1) ... [2024-10-12 16:00:45,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:00:45" (1/1) ... [2024-10-12 16:00:46,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:00:46,007 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:00:46,007 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:00:46,007 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:00:46,008 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:00:45" (1/1) ... [2024-10-12 16:00:46,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:00:46,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:00:46,040 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-12 16:00:46,045 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-12 16:00:46,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:00:46,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:00:46,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:00:46,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:00:46,132 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:00:46,134 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:00:47,244 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-12 16:00:47,244 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:00:47,280 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:00:47,280 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:00:47,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:00:47 BoogieIcfgContainer [2024-10-12 16:00:47,280 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:00:47,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:00:47,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:00:47,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:00:47,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:00:45" (1/3) ... [2024-10-12 16:00:47,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb2a4bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:00:47, skipping insertion in model container [2024-10-12 16:00:47,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:00:45" (2/3) ... [2024-10-12 16:00:47,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb2a4bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:00:47, skipping insertion in model container [2024-10-12 16:00:47,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:00:47" (3/3) ... [2024-10-12 16:00:47,286 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label38.c [2024-10-12 16:00:47,298 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:00:47,298 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:00:47,341 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:00:47,346 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;@5c267613, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:00:47,346 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:00:47,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 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-12 16:00:47,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 16:00:47,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:00:47,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:00:47,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:00:47,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:00:47,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1552183181, now seen corresponding path program 1 times [2024-10-12 16:00:47,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:00:47,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282856343] [2024-10-12 16:00:47,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:00:47,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:00:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:00:47,522 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-12 16:00:47,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:00:47,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282856343] [2024-10-12 16:00:47,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282856343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:00:47,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:00:47,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:00:47,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706812807] [2024-10-12 16:00:47,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:00:47,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:00:47,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:00:47,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:00:47,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:00:47,551 INFO L87 Difference]: Start difference. First operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 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 29.5) internal successors, (59), 2 states have internal predecessors, (59), 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-12 16:00:47,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:00:47,595 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2024-10-12 16:00:47,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:00:47,597 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 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 59 [2024-10-12 16:00:47,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:00:47,607 INFO L225 Difference]: With dead ends: 441 [2024-10-12 16:00:47,607 INFO L226 Difference]: Without dead ends: 219 [2024-10-12 16:00:47,611 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-12 16:00:47,615 INFO L432 NwaCegarLoop]: 355 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, 355 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-12 16:00:47,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:00:47,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-12 16:00:47,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-12 16:00:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 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-12 16:00:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2024-10-12 16:00:47,653 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 59 [2024-10-12 16:00:47,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:00:47,653 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2024-10-12 16:00:47,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 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-12 16:00:47,654 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2024-10-12 16:00:47,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 16:00:47,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:00:47,655 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:00:47,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:00:47,656 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:00:47,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:00:47,657 INFO L85 PathProgramCache]: Analyzing trace with hash -555731964, now seen corresponding path program 1 times [2024-10-12 16:00:47,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:00:47,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454128358] [2024-10-12 16:00:47,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:00:47,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:00:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:00:47,834 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-12 16:00:47,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:00:47,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454128358] [2024-10-12 16:00:47,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454128358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:00:47,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:00:47,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:00:47,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303605991] [2024-10-12 16:00:47,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:00:47,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:00:47,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:00:47,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:00:47,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:00:47,839 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 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-12 16:00:48,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:00:48,500 INFO L93 Difference]: Finished difference Result 630 states and 1026 transitions. [2024-10-12 16:00:48,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:00:48,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 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 59 [2024-10-12 16:00:48,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:00:48,503 INFO L225 Difference]: With dead ends: 630 [2024-10-12 16:00:48,503 INFO L226 Difference]: Without dead ends: 412 [2024-10-12 16:00:48,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12 16:00:48,505 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 164 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:00:48,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 155 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 16:00:48,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-12 16:00:48,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2024-10-12 16:00:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.4549878345498783) internal successors, (598), 411 states have internal predecessors, (598), 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-12 16:00:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 598 transitions. [2024-10-12 16:00:48,522 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 598 transitions. Word has length 59 [2024-10-12 16:00:48,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:00:48,522 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 598 transitions. [2024-10-12 16:00:48,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 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-12 16:00:48,523 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 598 transitions. [2024-10-12 16:00:48,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-12 16:00:48,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:00:48,526 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:00:48,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:00:48,526 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:00:48,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:00:48,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1668782468, now seen corresponding path program 1 times [2024-10-12 16:00:48,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:00:48,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089474049] [2024-10-12 16:00:48,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:00:48,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:00:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:00:48,723 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:00:48,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:00:48,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089474049] [2024-10-12 16:00:48,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089474049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:00:48,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:00:48,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:00:48,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689827595] [2024-10-12 16:00:48,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:00:48,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:00:48,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:00:48,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:00:48,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:00:48,726 INFO L87 Difference]: Start difference. First operand 412 states and 598 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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-12 16:00:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:00:49,382 INFO L93 Difference]: Finished difference Result 1210 states and 1762 transitions. [2024-10-12 16:00:49,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:00:49,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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 127 [2024-10-12 16:00:49,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:00:49,390 INFO L225 Difference]: With dead ends: 1210 [2024-10-12 16:00:49,391 INFO L226 Difference]: Without dead ends: 799 [2024-10-12 16:00:49,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12 16:00:49,394 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:00:49,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 118 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 16:00:49,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-10-12 16:00:49,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 788. [2024-10-12 16:00:49,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.3748411689961881) internal successors, (1082), 787 states have internal predecessors, (1082), 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-12 16:00:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1082 transitions. [2024-10-12 16:00:49,426 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1082 transitions. Word has length 127 [2024-10-12 16:00:49,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:00:49,426 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1082 transitions. [2024-10-12 16:00:49,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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-12 16:00:49,427 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1082 transitions. [2024-10-12 16:00:49,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-12 16:00:49,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:00:49,430 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:00:49,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:00:49,431 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:00:49,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:00:49,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1285805847, now seen corresponding path program 1 times [2024-10-12 16:00:49,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:00:49,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3425823] [2024-10-12 16:00:49,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:00:49,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:00:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:00:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:00:49,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:00:49,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3425823] [2024-10-12 16:00:49,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3425823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:00:49,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:00:49,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:00:49,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444444883] [2024-10-12 16:00:49,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:00:49,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:00:49,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:00:49,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:00:49,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:00:49,759 INFO L87 Difference]: Start difference. First operand 788 states and 1082 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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-12 16:00:50,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:00:50,350 INFO L93 Difference]: Finished difference Result 1944 states and 2611 transitions. [2024-10-12 16:00:50,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:00:50,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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 129 [2024-10-12 16:00:50,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:00:50,359 INFO L225 Difference]: With dead ends: 1944 [2024-10-12 16:00:50,360 INFO L226 Difference]: Without dead ends: 1157 [2024-10-12 16:00:50,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12 16:00:50,362 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:00:50,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 188 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 16:00:50,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-10-12 16:00:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2024-10-12 16:00:50,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.270995670995671) internal successors, (1468), 1155 states have internal predecessors, (1468), 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-12 16:00:50,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1468 transitions. [2024-10-12 16:00:50,413 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1468 transitions. Word has length 129 [2024-10-12 16:00:50,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:00:50,414 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1468 transitions. [2024-10-12 16:00:50,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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-12 16:00:50,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1468 transitions. [2024-10-12 16:00:50,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-12 16:00:50,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:00:50,425 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:00:50,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:00:50,426 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:00:50,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:00:50,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1287432789, now seen corresponding path program 1 times [2024-10-12 16:00:50,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:00:50,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358266063] [2024-10-12 16:00:50,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:00:50,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:00:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:00:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:00:50,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:00:50,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358266063] [2024-10-12 16:00:50,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358266063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:00:50,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:00:50,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:00:50,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135856750] [2024-10-12 16:00:50,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:00:50,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:00:50,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:00:50,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:00:50,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:00:50,710 INFO L87 Difference]: Start difference. First operand 1156 states and 1468 transitions. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 3 states have internal predecessors, (186), 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-12 16:00:51,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:00:51,738 INFO L93 Difference]: Finished difference Result 3444 states and 4563 transitions. [2024-10-12 16:00:51,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:00:51,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 3 states have internal predecessors, (186), 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 186 [2024-10-12 16:00:51,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:00:51,745 INFO L225 Difference]: With dead ends: 3444 [2024-10-12 16:00:51,746 INFO L226 Difference]: Without dead ends: 2473 [2024-10-12 16:00:51,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:00:51,748 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 334 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:00:51,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 84 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 16:00:51,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2024-10-12 16:00:51,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 2472. [2024-10-12 16:00:51,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2472 states, 2471 states have (on average 1.2869283690813436) internal successors, (3180), 2471 states have internal predecessors, (3180), 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-12 16:00:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3180 transitions. [2024-10-12 16:00:51,780 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3180 transitions. Word has length 186 [2024-10-12 16:00:51,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:00:51,781 INFO L471 AbstractCegarLoop]: Abstraction has 2472 states and 3180 transitions. [2024-10-12 16:00:51,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 3 states have internal predecessors, (186), 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-12 16:00:51,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3180 transitions. [2024-10-12 16:00:51,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-12 16:00:51,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:00:51,784 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:00:51,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:00:51,784 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:00:51,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:00:51,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1719319981, now seen corresponding path program 1 times [2024-10-12 16:00:51,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:00:51,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918210558] [2024-10-12 16:00:51,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:00:51,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:00:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:00:52,037 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-12 16:00:52,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:00:52,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918210558] [2024-10-12 16:00:52,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918210558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:00:52,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:00:52,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:00:52,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63769151] [2024-10-12 16:00:52,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:00:52,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:00:52,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:00:52,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:00:52,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:00:52,040 INFO L87 Difference]: Start difference. First operand 2472 states and 3180 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-12 16:00:52,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:00:52,782 INFO L93 Difference]: Finished difference Result 5689 states and 7505 transitions. [2024-10-12 16:00:52,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:00:52,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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 241 [2024-10-12 16:00:52,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:00:52,794 INFO L225 Difference]: With dead ends: 5689 [2024-10-12 16:00:52,795 INFO L226 Difference]: Without dead ends: 3586 [2024-10-12 16:00:52,797 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-12 16:00:52,799 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 137 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:00:52,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 390 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 16:00:52,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3586 states. [2024-10-12 16:00:52,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3586 to 3577. [2024-10-12 16:00:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3577 states, 3576 states have (on average 1.2502796420581654) internal successors, (4471), 3576 states have internal predecessors, (4471), 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-12 16:00:52,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4471 transitions. [2024-10-12 16:00:52,848 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4471 transitions. Word has length 241 [2024-10-12 16:00:52,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:00:52,850 INFO L471 AbstractCegarLoop]: Abstraction has 3577 states and 4471 transitions. [2024-10-12 16:00:52,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-12 16:00:52,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4471 transitions. [2024-10-12 16:00:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-12 16:00:52,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:00:52,854 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:00:52,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:00:52,854 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:00:52,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:00:52,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1766842588, now seen corresponding path program 1 times [2024-10-12 16:00:52,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:00:52,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502481095] [2024-10-12 16:00:52,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:00:52,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:00:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:00:53,332 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 91 proven. 24 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-12 16:00:53,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:00:53,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502481095] [2024-10-12 16:00:53,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502481095] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:00:53,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139844041] [2024-10-12 16:00:53,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:00:53,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:00:53,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:00:53,335 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-12 16:00:53,338 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-12 16:00:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:00:53,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:00:53,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:00:53,543 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-12 16:00:53,544 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:00:53,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139844041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:00:53,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:00:53,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-12 16:00:53,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656488029] [2024-10-12 16:00:53,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:00:53,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:00:53,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:00:53,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:00:53,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:00:53,545 INFO L87 Difference]: Start difference. First operand 3577 states and 4471 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-12 16:00:54,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:00:54,246 INFO L93 Difference]: Finished difference Result 9362 states and 11938 transitions. [2024-10-12 16:00:54,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:00:54,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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 247 [2024-10-12 16:00:54,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:00:54,265 INFO L225 Difference]: With dead ends: 9362 [2024-10-12 16:00:54,265 INFO L226 Difference]: Without dead ends: 6154 [2024-10-12 16:00:54,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:00:54,271 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 150 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:00:54,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 143 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 16:00:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6154 states. [2024-10-12 16:00:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6154 to 6154. [2024-10-12 16:00:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6154 states, 6153 states have (on average 1.2351698358524297) internal successors, (7600), 6153 states have internal predecessors, (7600), 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-12 16:00:54,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6154 states to 6154 states and 7600 transitions. [2024-10-12 16:00:54,360 INFO L78 Accepts]: Start accepts. Automaton has 6154 states and 7600 transitions. Word has length 247 [2024-10-12 16:00:54,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:00:54,361 INFO L471 AbstractCegarLoop]: Abstraction has 6154 states and 7600 transitions. [2024-10-12 16:00:54,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-12 16:00:54,361 INFO L276 IsEmpty]: Start isEmpty. Operand 6154 states and 7600 transitions. [2024-10-12 16:00:54,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-10-12 16:00:54,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:00:54,409 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:00:54,428 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-12 16:00:54,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:00:54,611 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:00:54,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:00:54,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2034998991, now seen corresponding path program 1 times [2024-10-12 16:00:54,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:00:54,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607414046] [2024-10-12 16:00:54,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:00:54,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:00:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:00:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-12 16:00:55,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:00:55,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607414046] [2024-10-12 16:00:55,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607414046] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:00:55,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256965836] [2024-10-12 16:00:55,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:00:55,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:00:55,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:00:55,056 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-12 16:00:55,092 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-12 16:00:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:00:55,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 16:00:55,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:00:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-12 16:00:55,669 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 16:01:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-12 16:01:00,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256965836] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 16:01:00,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 16:01:00,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-10-12 16:01:00,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925571882] [2024-10-12 16:01:00,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:01:00,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:01:00,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:01:00,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:01:00,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:01:00,984 INFO L87 Difference]: Start difference. First operand 6154 states and 7600 transitions. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 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-12 16:01:02,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:01:02,551 INFO L93 Difference]: Finished difference Result 13972 states and 17911 transitions. [2024-10-12 16:01:02,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:01:02,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 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 278 [2024-10-12 16:01:02,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:01:02,577 INFO L225 Difference]: With dead ends: 13972 [2024-10-12 16:01:02,577 INFO L226 Difference]: Without dead ends: 9113 [2024-10-12 16:01:02,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 553 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-12 16:01:02,587 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 278 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:01:02,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 168 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:01:02,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9113 states. [2024-10-12 16:01:02,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9113 to 7995. [2024-10-12 16:01:02,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7995 states, 7994 states have (on average 1.2215411558669003) internal successors, (9765), 7994 states have internal predecessors, (9765), 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-12 16:01:02,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7995 states to 7995 states and 9765 transitions. [2024-10-12 16:01:02,721 INFO L78 Accepts]: Start accepts. Automaton has 7995 states and 9765 transitions. Word has length 278 [2024-10-12 16:01:02,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:01:02,722 INFO L471 AbstractCegarLoop]: Abstraction has 7995 states and 9765 transitions. [2024-10-12 16:01:02,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 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-12 16:01:02,723 INFO L276 IsEmpty]: Start isEmpty. Operand 7995 states and 9765 transitions. [2024-10-12 16:01:02,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2024-10-12 16:01:02,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:01:02,730 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:01:02,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 16:01:02,934 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,SelfDestructingSolverStorable7 [2024-10-12 16:01:02,935 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:01:02,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:01:02,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1202533516, now seen corresponding path program 1 times [2024-10-12 16:01:02,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:01:02,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480617303] [2024-10-12 16:01:02,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:01:02,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:01:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:01:03,062 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-10-12 16:01:03,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:01:03,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480617303] [2024-10-12 16:01:03,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480617303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:01:03,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:01:03,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:01:03,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65593185] [2024-10-12 16:01:03,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:01:03,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:01:03,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:01:03,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:01:03,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:01:03,064 INFO L87 Difference]: Start difference. First operand 7995 states and 9765 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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-12 16:01:04,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:01:04,017 INFO L93 Difference]: Finished difference Result 18195 states and 22456 transitions. [2024-10-12 16:01:04,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:01:04,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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 289 [2024-10-12 16:01:04,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:01:04,047 INFO L225 Difference]: With dead ends: 18195 [2024-10-12 16:01:04,047 INFO L226 Difference]: Without dead ends: 10569 [2024-10-12 16:01:04,054 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-12 16:01:04,055 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 167 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:01:04,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 322 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 16:01:04,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10569 states. [2024-10-12 16:01:04,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10569 to 10200. [2024-10-12 16:01:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10200 states, 10199 states have (on average 1.2079615648592998) internal successors, (12320), 10199 states have internal predecessors, (12320), 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-12 16:01:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10200 states to 10200 states and 12320 transitions. [2024-10-12 16:01:04,171 INFO L78 Accepts]: Start accepts. Automaton has 10200 states and 12320 transitions. Word has length 289 [2024-10-12 16:01:04,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:01:04,172 INFO L471 AbstractCegarLoop]: Abstraction has 10200 states and 12320 transitions. [2024-10-12 16:01:04,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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-12 16:01:04,172 INFO L276 IsEmpty]: Start isEmpty. Operand 10200 states and 12320 transitions. [2024-10-12 16:01:04,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-10-12 16:01:04,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:01:04,180 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:01:04,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 16:01:04,181 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:01:04,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:01:04,181 INFO L85 PathProgramCache]: Analyzing trace with hash -567302034, now seen corresponding path program 1 times [2024-10-12 16:01:04,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:01:04,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047895047] [2024-10-12 16:01:04,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:01:04,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:01:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:01:04,413 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:01:04,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:01:04,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047895047] [2024-10-12 16:01:04,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047895047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:01:04,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:01:04,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:01:04,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717985529] [2024-10-12 16:01:04,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:01:04,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:01:04,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:01:04,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:01:04,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:01:04,415 INFO L87 Difference]: Start difference. First operand 10200 states and 12320 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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-12 16:01:05,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:01:05,172 INFO L93 Difference]: Finished difference Result 22433 states and 27272 transitions. [2024-10-12 16:01:05,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:01:05,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 329 [2024-10-12 16:01:05,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:01:05,173 INFO L225 Difference]: With dead ends: 22433 [2024-10-12 16:01:05,173 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 16:01:05,187 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-12 16:01:05,187 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 61 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:01:05,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 338 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 16:01:05,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 16:01:05,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 16:01:05,188 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-12 16:01:05,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 16:01:05,188 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 329 [2024-10-12 16:01:05,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:01:05,189 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 16:01:05,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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-12 16:01:05,189 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 16:01:05,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 16:01:05,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 16:01:05,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 16:01:05,194 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:01:05,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 16:01:05,299 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 16:01:05,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 04:01:05 BoogieIcfgContainer [2024-10-12 16:01:05,321 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 16:01:05,321 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 16:01:05,321 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 16:01:05,321 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 16:01:05,322 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:00:47" (3/4) ... [2024-10-12 16:01:05,323 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 16:01:05,346 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-12 16:01:05,348 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 16:01:05,349 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 16:01:05,350 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 16:01:05,500 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 16:01:05,500 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 16:01:05,500 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 16:01:05,501 INFO L158 Benchmark]: Toolchain (without parser) took 20388.30ms. Allocated memory was 220.2MB in the beginning and 725.6MB in the end (delta: 505.4MB). Free memory was 145.7MB in the beginning and 341.5MB in the end (delta: -195.8MB). Peak memory consumption was 310.3MB. Max. memory is 16.1GB. [2024-10-12 16:01:05,501 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 121.6MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 16:01:05,501 INFO L158 Benchmark]: CACSL2BoogieTranslator took 566.19ms. Allocated memory is still 220.2MB. Free memory was 145.1MB in the beginning and 98.4MB in the end (delta: 46.7MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-10-12 16:01:05,502 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.57ms. Allocated memory is still 220.2MB. Free memory was 98.4MB in the beginning and 80.7MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-12 16:01:05,502 INFO L158 Benchmark]: Boogie Preprocessor took 221.21ms. Allocated memory is still 220.2MB. Free memory was 80.7MB in the beginning and 162.0MB in the end (delta: -81.3MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2024-10-12 16:01:05,502 INFO L158 Benchmark]: RCFGBuilder took 1273.69ms. Allocated memory is still 220.2MB. Free memory was 162.0MB in the beginning and 86.2MB in the end (delta: 75.7MB). Peak memory consumption was 105.1MB. Max. memory is 16.1GB. [2024-10-12 16:01:05,503 INFO L158 Benchmark]: TraceAbstraction took 18039.08ms. Allocated memory was 220.2MB in the beginning and 725.6MB in the end (delta: 505.4MB). Free memory was 86.2MB in the beginning and 358.3MB in the end (delta: -272.0MB). Peak memory consumption was 232.3MB. Max. memory is 16.1GB. [2024-10-12 16:01:05,503 INFO L158 Benchmark]: Witness Printer took 179.09ms. Allocated memory is still 725.6MB. Free memory was 358.3MB in the beginning and 341.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 16:01:05,504 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.12ms. Allocated memory is still 121.6MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 566.19ms. Allocated memory is still 220.2MB. Free memory was 145.1MB in the beginning and 98.4MB in the end (delta: 46.7MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.57ms. Allocated memory is still 220.2MB. Free memory was 98.4MB in the beginning and 80.7MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 221.21ms. Allocated memory is still 220.2MB. Free memory was 80.7MB in the beginning and 162.0MB in the end (delta: -81.3MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1273.69ms. Allocated memory is still 220.2MB. Free memory was 162.0MB in the beginning and 86.2MB in the end (delta: 75.7MB). Peak memory consumption was 105.1MB. Max. memory is 16.1GB. * TraceAbstraction took 18039.08ms. Allocated memory was 220.2MB in the beginning and 725.6MB in the end (delta: 505.4MB). Free memory was 86.2MB in the beginning and 358.3MB in the end (delta: -272.0MB). Peak memory consumption was 232.3MB. Max. memory is 16.1GB. * Witness Printer took 179.09ms. Allocated memory is still 725.6MB. Free memory was 358.3MB in the beginning and 341.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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: 196]: 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, 221 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.9s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1552 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1552 mSDsluCounter, 2261 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 251 mSDsCounter, 1029 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5977 IncrementalHoareTripleChecker+Invalid, 7006 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1029 mSolverCounterUnsat, 2010 mSDtfsCounter, 5977 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 828 GetRequests, 811 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10200occurred in iteration=9, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 1509 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 2469 NumberOfCodeBlocks, 2469 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2734 ConstructedInterpolants, 0 QuantifiedInterpolants, 21790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 743 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 1570/1824 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: 1044]: Loop Invariant Derived loop invariant: ((((((a25 == 12) || (138 < a23)) || (a25 < 11)) || (a25 == 11)) || (a4 != 1)) || (a29 < 246)) RESULT: Ultimate proved your program to be correct! [2024-10-12 16:01:05,528 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