./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/Problem10_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label00.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b49fbf439c6d5cf33b5a144a2382feff3c2b3eeb58f6496beb37cacb5d6cd07 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:15:23,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:15:23,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:15:23,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:15:23,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:15:23,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:15:23,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:15:23,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:15:23,738 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:15:23,749 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:15:23,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:15:23,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:15:23,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:15:23,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:15:23,750 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:15:23,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:15:23,751 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:15:23,751 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:15:23,751 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:15:23,751 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:15:23,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:15:23,758 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:15:23,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:15:23,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:15:23,758 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:15:23,758 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:15:23,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:15:23,759 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:15:23,759 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:15:23,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:15:23,760 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:15:23,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:15:23,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:15:23,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:15:23,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:15:23,761 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:15:23,761 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:15:23,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:15:23,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:15:23,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:15:23,762 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:15:23,762 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:15:23,762 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b49fbf439c6d5cf33b5a144a2382feff3c2b3eeb58f6496beb37cacb5d6cd07 [2024-10-10 23:15:23,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:15:23,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:15:23,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:15:23,995 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:15:23,995 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:15:23,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label00.c [2024-10-10 23:15:25,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:15:25,439 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:15:25,440 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label00.c [2024-10-10 23:15:25,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/195848ce8/9d19d52c6552468ea481c5683791e02b/FLAG4c6769a23 [2024-10-10 23:15:25,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/195848ce8/9d19d52c6552468ea481c5683791e02b [2024-10-10 23:15:25,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:15:25,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:15:25,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:15:25,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:15:25,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:15:25,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:15:25" (1/1) ... [2024-10-10 23:15:25,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cb410eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:25, skipping insertion in model container [2024-10-10 23:15:25,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:15:25" (1/1) ... [2024-10-10 23:15:25,864 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:15:26,012 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/Problem10_label00.c[5445,5458] [2024-10-10 23:15:26,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:15:26,168 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:15:26,193 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/Problem10_label00.c[5445,5458] [2024-10-10 23:15:26,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:15:26,248 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:15:26,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:26 WrapperNode [2024-10-10 23:15:26,248 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:15:26,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:15:26,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:15:26,249 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:15:26,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:26" (1/1) ... [2024-10-10 23:15:26,266 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:26" (1/1) ... [2024-10-10 23:15:26,316 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-10-10 23:15:26,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:15:26,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:15:26,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:15:26,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:15:26,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:26" (1/1) ... [2024-10-10 23:15:26,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:26" (1/1) ... [2024-10-10 23:15:26,331 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:26" (1/1) ... [2024-10-10 23:15:26,361 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-10 23:15:26,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:26" (1/1) ... [2024-10-10 23:15:26,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:26" (1/1) ... [2024-10-10 23:15:26,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:26" (1/1) ... [2024-10-10 23:15:26,389 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:26" (1/1) ... [2024-10-10 23:15:26,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:26" (1/1) ... [2024-10-10 23:15:26,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:26" (1/1) ... [2024-10-10 23:15:26,416 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:15:26,417 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:15:26,417 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:15:26,417 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:15:26,418 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:26" (1/1) ... [2024-10-10 23:15:26,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:15:26,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:15:26,444 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:15:26,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:15:26,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:15:26,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:15:26,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:15:26,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:15:26,521 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:15:26,522 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:15:27,299 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-10 23:15:27,299 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:15:27,345 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:15:27,346 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:15:27,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:15:27 BoogieIcfgContainer [2024-10-10 23:15:27,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:15:27,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:15:27,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:15:27,351 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:15:27,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:15:25" (1/3) ... [2024-10-10 23:15:27,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab59f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:15:27, skipping insertion in model container [2024-10-10 23:15:27,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:26" (2/3) ... [2024-10-10 23:15:27,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab59f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:15:27, skipping insertion in model container [2024-10-10 23:15:27,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:15:27" (3/3) ... [2024-10-10 23:15:27,353 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label00.c [2024-10-10 23:15:27,365 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:15:27,365 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:15:27,409 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:15:27,415 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;@1b371df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:15:27,416 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:15:27,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 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-10 23:15:27,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-10 23:15:27,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:27,425 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] [2024-10-10 23:15:27,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:27,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:27,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1671139151, now seen corresponding path program 1 times [2024-10-10 23:15:27,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:27,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982906621] [2024-10-10 23:15:27,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:27,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:27,599 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-10 23:15:27,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:27,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982906621] [2024-10-10 23:15:27,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982906621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:27,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:27,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:15:27,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010590216] [2024-10-10 23:15:27,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:27,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:15:27,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:27,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:15:27,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:15:27,627 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 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 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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-10 23:15:27,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:27,659 INFO L93 Difference]: Finished difference Result 287 states and 563 transitions. [2024-10-10 23:15:27,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:15:27,661 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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 46 [2024-10-10 23:15:27,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:27,670 INFO L225 Difference]: With dead ends: 287 [2024-10-10 23:15:27,670 INFO L226 Difference]: Without dead ends: 142 [2024-10-10 23:15:27,672 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-10 23:15:27,676 INFO L432 NwaCegarLoop]: 217 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, 217 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-10 23:15:27,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:15:27,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-10 23:15:27,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-10 23:15:27,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 states have internal predecessors, (217), 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-10 23:15:27,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-10-10 23:15:27,706 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 46 [2024-10-10 23:15:27,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:27,706 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-10-10 23:15:27,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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-10 23:15:27,706 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-10-10 23:15:27,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-10 23:15:27,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:27,707 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] [2024-10-10 23:15:27,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:15:27,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:27,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:27,708 INFO L85 PathProgramCache]: Analyzing trace with hash 301914438, now seen corresponding path program 1 times [2024-10-10 23:15:27,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:27,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966163332] [2024-10-10 23:15:27,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:27,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:27,857 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-10 23:15:27,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:27,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966163332] [2024-10-10 23:15:27,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966163332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:27,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:27,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:15:27,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055433945] [2024-10-10 23:15:27,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:27,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:27,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:27,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:27,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:27,860 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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-10 23:15:28,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:28,339 INFO L93 Difference]: Finished difference Result 283 states and 433 transitions. [2024-10-10 23:15:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:28,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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 46 [2024-10-10 23:15:28,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:28,342 INFO L225 Difference]: With dead ends: 283 [2024-10-10 23:15:28,345 INFO L226 Difference]: Without dead ends: 281 [2024-10-10 23:15:28,345 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-10 23:15:28,346 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 137 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:28,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 9 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:15:28,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-10 23:15:28,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-10 23:15:28,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.5392857142857144) internal successors, (431), 280 states have internal predecessors, (431), 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-10 23:15:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 431 transitions. [2024-10-10 23:15:28,375 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 431 transitions. Word has length 46 [2024-10-10 23:15:28,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:28,375 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 431 transitions. [2024-10-10 23:15:28,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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-10 23:15:28,375 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 431 transitions. [2024-10-10 23:15:28,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-10 23:15:28,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:28,378 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, 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-10 23:15:28,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:15:28,378 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:28,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:28,379 INFO L85 PathProgramCache]: Analyzing trace with hash -388989004, now seen corresponding path program 1 times [2024-10-10 23:15:28,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:28,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051688530] [2024-10-10 23:15:28,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:28,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:15:28,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:28,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051688530] [2024-10-10 23:15:28,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051688530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:28,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:28,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:15:28,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717379581] [2024-10-10 23:15:28,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:28,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:28,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:28,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:28,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:28,726 INFO L87 Difference]: Start difference. First operand 281 states and 431 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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-10 23:15:29,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:29,113 INFO L93 Difference]: Finished difference Result 700 states and 1075 transitions. [2024-10-10 23:15:29,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:29,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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 115 [2024-10-10 23:15:29,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:29,116 INFO L225 Difference]: With dead ends: 700 [2024-10-10 23:15:29,116 INFO L226 Difference]: Without dead ends: 420 [2024-10-10 23:15:29,117 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-10 23:15:29,118 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 73 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:29,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 50 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:15:29,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-10 23:15:29,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-10-10 23:15:29,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.4439140811455846) internal successors, (605), 419 states have internal predecessors, (605), 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-10 23:15:29,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 605 transitions. [2024-10-10 23:15:29,135 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 605 transitions. Word has length 115 [2024-10-10 23:15:29,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:29,136 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 605 transitions. [2024-10-10 23:15:29,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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-10 23:15:29,136 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 605 transitions. [2024-10-10 23:15:29,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-10 23:15:29,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:29,139 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, 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-10 23:15:29,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:15:29,139 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:29,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:29,139 INFO L85 PathProgramCache]: Analyzing trace with hash -634084573, now seen corresponding path program 1 times [2024-10-10 23:15:29,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:29,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193856018] [2024-10-10 23:15:29,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:29,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:29,281 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:15:29,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:29,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193856018] [2024-10-10 23:15:29,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193856018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:29,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:29,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:15:29,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148276949] [2024-10-10 23:15:29,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:29,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:29,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:29,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:29,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:29,286 INFO L87 Difference]: Start difference. First operand 420 states and 605 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-10 23:15:29,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:29,664 INFO L93 Difference]: Finished difference Result 1117 states and 1638 transitions. [2024-10-10 23:15:29,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:29,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 121 [2024-10-10 23:15:29,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:29,667 INFO L225 Difference]: With dead ends: 1117 [2024-10-10 23:15:29,667 INFO L226 Difference]: Without dead ends: 837 [2024-10-10 23:15:29,668 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-10 23:15:29,669 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 95 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:29,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 223 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:15:29,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-10 23:15:29,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 698. [2024-10-10 23:15:29,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.3314203730272596) internal successors, (928), 697 states have internal predecessors, (928), 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-10 23:15:29,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 928 transitions. [2024-10-10 23:15:29,683 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 928 transitions. Word has length 121 [2024-10-10 23:15:29,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:29,684 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 928 transitions. [2024-10-10 23:15:29,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-10 23:15:29,684 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 928 transitions. [2024-10-10 23:15:29,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-10 23:15:29,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:29,686 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, 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-10 23:15:29,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:15:29,687 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:29,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:29,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1831341025, now seen corresponding path program 1 times [2024-10-10 23:15:29,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:29,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956407447] [2024-10-10 23:15:29,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:29,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:15:29,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:29,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956407447] [2024-10-10 23:15:29,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956407447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:29,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:29,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:15:29,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126201366] [2024-10-10 23:15:29,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:29,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:29,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:29,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:29,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:29,804 INFO L87 Difference]: Start difference. First operand 698 states and 928 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 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-10 23:15:30,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:30,190 INFO L93 Difference]: Finished difference Result 1395 states and 1961 transitions. [2024-10-10 23:15:30,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:30,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 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 140 [2024-10-10 23:15:30,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:30,193 INFO L225 Difference]: With dead ends: 1395 [2024-10-10 23:15:30,193 INFO L226 Difference]: Without dead ends: 837 [2024-10-10 23:15:30,194 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-10 23:15:30,197 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 52 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:30,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 74 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:15:30,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-10 23:15:30,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2024-10-10 23:15:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.2834928229665072) internal successors, (1073), 836 states have internal predecessors, (1073), 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-10 23:15:30,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1073 transitions. [2024-10-10 23:15:30,212 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1073 transitions. Word has length 140 [2024-10-10 23:15:30,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:30,212 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1073 transitions. [2024-10-10 23:15:30,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 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-10 23:15:30,213 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1073 transitions. [2024-10-10 23:15:30,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-10 23:15:30,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:30,215 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, 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] [2024-10-10 23:15:30,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:15:30,215 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:30,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:30,215 INFO L85 PathProgramCache]: Analyzing trace with hash -646455039, now seen corresponding path program 1 times [2024-10-10 23:15:30,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:30,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787024037] [2024-10-10 23:15:30,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:30,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:30,321 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-10 23:15:30,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:30,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787024037] [2024-10-10 23:15:30,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787024037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:30,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:30,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:15:30,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611948640] [2024-10-10 23:15:30,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:30,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:30,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:30,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:30,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:30,323 INFO L87 Difference]: Start difference. First operand 837 states and 1073 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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-10 23:15:30,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:30,681 INFO L93 Difference]: Finished difference Result 1812 states and 2329 transitions. [2024-10-10 23:15:30,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:30,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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 181 [2024-10-10 23:15:30,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:30,685 INFO L225 Difference]: With dead ends: 1812 [2024-10-10 23:15:30,685 INFO L226 Difference]: Without dead ends: 1115 [2024-10-10 23:15:30,687 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-10 23:15:30,689 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 107 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:30,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 32 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:15:30,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2024-10-10 23:15:30,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2024-10-10 23:15:30,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.1768402154398563) internal successors, (1311), 1114 states have internal predecessors, (1311), 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-10 23:15:30,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1311 transitions. [2024-10-10 23:15:30,708 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1311 transitions. Word has length 181 [2024-10-10 23:15:30,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:30,708 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1311 transitions. [2024-10-10 23:15:30,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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-10 23:15:30,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1311 transitions. [2024-10-10 23:15:30,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-10 23:15:30,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:30,711 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, 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-10 23:15:30,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:15:30,711 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:30,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:30,712 INFO L85 PathProgramCache]: Analyzing trace with hash -521574818, now seen corresponding path program 1 times [2024-10-10 23:15:30,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:30,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751424317] [2024-10-10 23:15:30,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:30,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:30,935 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:15:30,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:30,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751424317] [2024-10-10 23:15:30,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751424317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:30,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:30,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:15:30,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793428517] [2024-10-10 23:15:30,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:30,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:30,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:30,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:30,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:30,937 INFO L87 Difference]: Start difference. First operand 1115 states and 1311 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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-10 23:15:31,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:31,282 INFO L93 Difference]: Finished difference Result 2368 states and 2856 transitions. [2024-10-10 23:15:31,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:31,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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 198 [2024-10-10 23:15:31,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:31,286 INFO L225 Difference]: With dead ends: 2368 [2024-10-10 23:15:31,286 INFO L226 Difference]: Without dead ends: 1393 [2024-10-10 23:15:31,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10 23:15:31,288 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 78 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:31,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 17 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:15:31,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-10-10 23:15:31,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1393. [2024-10-10 23:15:31,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1392 states have (on average 1.1997126436781609) internal successors, (1670), 1392 states have internal predecessors, (1670), 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-10 23:15:31,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1670 transitions. [2024-10-10 23:15:31,305 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1670 transitions. Word has length 198 [2024-10-10 23:15:31,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:31,306 INFO L471 AbstractCegarLoop]: Abstraction has 1393 states and 1670 transitions. [2024-10-10 23:15:31,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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-10 23:15:31,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1670 transitions. [2024-10-10 23:15:31,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-10 23:15:31,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:31,308 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, 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] [2024-10-10 23:15:31,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:15:31,308 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:31,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:31,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1024609422, now seen corresponding path program 1 times [2024-10-10 23:15:31,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:31,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113513291] [2024-10-10 23:15:31,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:31,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:31,445 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:15:31,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:31,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113513291] [2024-10-10 23:15:31,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113513291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:31,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:31,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:15:31,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281167541] [2024-10-10 23:15:31,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:31,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:31,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:31,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:31,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:31,449 INFO L87 Difference]: Start difference. First operand 1393 states and 1670 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-10 23:15:31,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:31,783 INFO L93 Difference]: Finished difference Result 2924 states and 3554 transitions. [2024-10-10 23:15:31,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:31,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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 206 [2024-10-10 23:15:31,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:31,787 INFO L225 Difference]: With dead ends: 2924 [2024-10-10 23:15:31,787 INFO L226 Difference]: Without dead ends: 1671 [2024-10-10 23:15:31,788 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-10 23:15:31,790 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 50 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:31,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 212 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:15:31,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2024-10-10 23:15:31,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1532. [2024-10-10 23:15:31,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 1.1881123448726323) internal successors, (1819), 1531 states have internal predecessors, (1819), 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-10 23:15:31,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1819 transitions. [2024-10-10 23:15:31,810 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1819 transitions. Word has length 206 [2024-10-10 23:15:31,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:31,811 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 1819 transitions. [2024-10-10 23:15:31,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-10 23:15:31,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1819 transitions. [2024-10-10 23:15:31,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-10 23:15:31,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:31,813 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, 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] [2024-10-10 23:15:31,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:15:31,814 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:31,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:31,814 INFO L85 PathProgramCache]: Analyzing trace with hash -649135019, now seen corresponding path program 1 times [2024-10-10 23:15:31,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:31,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55986414] [2024-10-10 23:15:31,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:31,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-10 23:15:31,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:31,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55986414] [2024-10-10 23:15:31,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55986414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:31,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:31,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:15:31,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815057253] [2024-10-10 23:15:31,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:31,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:31,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:31,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:31,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:31,920 INFO L87 Difference]: Start difference. First operand 1532 states and 1819 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-10 23:15:32,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:32,283 INFO L93 Difference]: Finished difference Result 2090 states and 2463 transitions. [2024-10-10 23:15:32,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:32,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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 220 [2024-10-10 23:15:32,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:32,288 INFO L225 Difference]: With dead ends: 2090 [2024-10-10 23:15:32,288 INFO L226 Difference]: Without dead ends: 2088 [2024-10-10 23:15:32,288 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-10 23:15:32,289 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 136 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:32,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 9 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:15:32,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2024-10-10 23:15:32,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 1532. [2024-10-10 23:15:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 1.1881123448726323) internal successors, (1819), 1531 states have internal predecessors, (1819), 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-10 23:15:32,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1819 transitions. [2024-10-10 23:15:32,309 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1819 transitions. Word has length 220 [2024-10-10 23:15:32,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:32,309 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 1819 transitions. [2024-10-10 23:15:32,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-10 23:15:32,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1819 transitions. [2024-10-10 23:15:32,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-10-10 23:15:32,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:32,312 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-10 23:15:32,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:15:32,312 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:32,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:32,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1270984020, now seen corresponding path program 1 times [2024-10-10 23:15:32,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:32,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596413733] [2024-10-10 23:15:32,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:32,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:32,649 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-10 23:15:32,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:32,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596413733] [2024-10-10 23:15:32,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596413733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:32,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:32,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:15:32,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110804892] [2024-10-10 23:15:32,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:32,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 23:15:32,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:32,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 23:15:32,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:15:32,652 INFO L87 Difference]: Start difference. First operand 1532 states and 1819 transitions. Second operand has 7 states, 7 states have (on average 35.42857142857143) internal successors, (248), 6 states have internal predecessors, (248), 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-10 23:15:33,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:33,138 INFO L93 Difference]: Finished difference Result 2979 states and 3548 transitions. [2024-10-10 23:15:33,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 23:15:33,139 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.42857142857143) internal successors, (248), 6 states have internal predecessors, (248), 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 309 [2024-10-10 23:15:33,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:33,143 INFO L225 Difference]: With dead ends: 2979 [2024-10-10 23:15:33,143 INFO L226 Difference]: Without dead ends: 1532 [2024-10-10 23:15:33,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:15:33,145 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:33,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 25 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:15:33,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-10-10 23:15:33,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1532. [2024-10-10 23:15:33,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 1.1828870019595037) internal successors, (1811), 1531 states have internal predecessors, (1811), 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-10 23:15:33,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1811 transitions. [2024-10-10 23:15:33,164 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1811 transitions. Word has length 309 [2024-10-10 23:15:33,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:33,165 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 1811 transitions. [2024-10-10 23:15:33,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.42857142857143) internal successors, (248), 6 states have internal predecessors, (248), 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-10 23:15:33,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1811 transitions. [2024-10-10 23:15:33,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2024-10-10 23:15:33,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:33,168 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:15:33,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:15:33,168 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:33,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:33,169 INFO L85 PathProgramCache]: Analyzing trace with hash 63225926, now seen corresponding path program 1 times [2024-10-10 23:15:33,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:33,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252152646] [2024-10-10 23:15:33,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:33,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:33,516 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-10-10 23:15:33,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:33,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252152646] [2024-10-10 23:15:33,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252152646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:33,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:33,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:15:33,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017230576] [2024-10-10 23:15:33,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:33,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:33,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:33,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:33,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:33,518 INFO L87 Difference]: Start difference. First operand 1532 states and 1811 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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-10 23:15:33,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:33,838 INFO L93 Difference]: Finished difference Result 2924 states and 3478 transitions. [2024-10-10 23:15:33,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:33,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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 345 [2024-10-10 23:15:33,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:33,842 INFO L225 Difference]: With dead ends: 2924 [2024-10-10 23:15:33,842 INFO L226 Difference]: Without dead ends: 1532 [2024-10-10 23:15:33,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10 23:15:33,844 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 117 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:33,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 156 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:15:33,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-10-10 23:15:33,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1254. [2024-10-10 23:15:33,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.1452513966480447) internal successors, (1435), 1253 states have internal predecessors, (1435), 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-10 23:15:33,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1435 transitions. [2024-10-10 23:15:33,864 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1435 transitions. Word has length 345 [2024-10-10 23:15:33,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:33,865 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1435 transitions. [2024-10-10 23:15:33,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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-10 23:15:33,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1435 transitions. [2024-10-10 23:15:33,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-10-10 23:15:33,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:33,868 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:15:33,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:15:33,869 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:33,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:33,869 INFO L85 PathProgramCache]: Analyzing trace with hash -635348172, now seen corresponding path program 1 times [2024-10-10 23:15:33,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:33,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720597319] [2024-10-10 23:15:33,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:33,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-10 23:15:34,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:34,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720597319] [2024-10-10 23:15:34,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720597319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:34,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:34,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:15:34,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587116956] [2024-10-10 23:15:34,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:34,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:34,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:34,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:34,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:34,070 INFO L87 Difference]: Start difference. First operand 1254 states and 1435 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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-10 23:15:34,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:34,424 INFO L93 Difference]: Finished difference Result 3202 states and 3709 transitions. [2024-10-10 23:15:34,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:34,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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 347 [2024-10-10 23:15:34,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:34,430 INFO L225 Difference]: With dead ends: 3202 [2024-10-10 23:15:34,430 INFO L226 Difference]: Without dead ends: 2088 [2024-10-10 23:15:34,432 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-10 23:15:34,432 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 21 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:34,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 202 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:15:34,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2024-10-10 23:15:34,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 2088. [2024-10-10 23:15:34,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 2087 states have (on average 1.127934834690944) internal successors, (2354), 2087 states have internal predecessors, (2354), 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-10 23:15:34,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 2354 transitions. [2024-10-10 23:15:34,457 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 2354 transitions. Word has length 347 [2024-10-10 23:15:34,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:34,458 INFO L471 AbstractCegarLoop]: Abstraction has 2088 states and 2354 transitions. [2024-10-10 23:15:34,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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-10 23:15:34,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2354 transitions. [2024-10-10 23:15:34,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2024-10-10 23:15:34,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:34,463 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:15:34,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:15:34,463 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:34,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:34,464 INFO L85 PathProgramCache]: Analyzing trace with hash -2071505958, now seen corresponding path program 1 times [2024-10-10 23:15:34,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:34,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590427001] [2024-10-10 23:15:34,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:34,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:34,876 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-10-10 23:15:34,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:34,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590427001] [2024-10-10 23:15:34,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590427001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:34,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:34,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:15:34,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975604586] [2024-10-10 23:15:34,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:34,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:15:34,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:34,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:15:34,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:15:34,878 INFO L87 Difference]: Start difference. First operand 2088 states and 2354 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 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-10 23:15:35,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:35,154 INFO L93 Difference]: Finished difference Result 3901 states and 4420 transitions. [2024-10-10 23:15:35,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:15:35,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 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 360 [2024-10-10 23:15:35,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:35,155 INFO L225 Difference]: With dead ends: 3901 [2024-10-10 23:15:35,155 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:15:35,157 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-10 23:15:35,158 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 89 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:35,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 9 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:15:35,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:15:35,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:15:35,159 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-10 23:15:35,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:15:35,159 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 360 [2024-10-10 23:15:35,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:35,159 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:15:35,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 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-10 23:15:35,160 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:15:35,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:15:35,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:15:35,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:15:35,166 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:15:35,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:15:35,375 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:15:35,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:15:35 BoogieIcfgContainer [2024-10-10 23:15:35,392 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:15:35,392 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:15:35,392 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:15:35,392 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:15:35,393 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:15:27" (3/4) ... [2024-10-10 23:15:35,396 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:15:35,411 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:15:35,412 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:15:35,412 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:15:35,413 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:15:35,531 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:15:35,533 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:15:35,533 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:15:35,533 INFO L158 Benchmark]: Toolchain (without parser) took 9718.50ms. Allocated memory was 176.2MB in the beginning and 343.9MB in the end (delta: 167.8MB). Free memory was 107.3MB in the beginning and 189.1MB in the end (delta: -81.8MB). Peak memory consumption was 88.8MB. Max. memory is 16.1GB. [2024-10-10 23:15:35,534 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:15:35,534 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.76ms. Allocated memory is still 176.2MB. Free memory was 107.1MB in the beginning and 130.0MB in the end (delta: -22.9MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2024-10-10 23:15:35,534 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.23ms. Allocated memory is still 176.2MB. Free memory was 130.0MB in the beginning and 122.3MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-10 23:15:35,534 INFO L158 Benchmark]: Boogie Preprocessor took 99.80ms. Allocated memory is still 176.2MB. Free memory was 122.3MB in the beginning and 111.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-10 23:15:35,534 INFO L158 Benchmark]: RCFGBuilder took 928.87ms. Allocated memory is still 176.2MB. Free memory was 111.8MB in the beginning and 77.7MB in the end (delta: 34.0MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2024-10-10 23:15:35,535 INFO L158 Benchmark]: TraceAbstraction took 8043.48ms. Allocated memory was 176.2MB in the beginning and 343.9MB in the end (delta: 167.8MB). Free memory was 76.8MB in the beginning and 200.7MB in the end (delta: -123.9MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. [2024-10-10 23:15:35,535 INFO L158 Benchmark]: Witness Printer took 140.56ms. Allocated memory is still 343.9MB. Free memory was 200.7MB in the beginning and 189.1MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 23:15:35,536 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.13ms. Allocated memory is still 104.9MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 432.76ms. Allocated memory is still 176.2MB. Free memory was 107.1MB in the beginning and 130.0MB in the end (delta: -22.9MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.23ms. Allocated memory is still 176.2MB. Free memory was 130.0MB in the beginning and 122.3MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.80ms. Allocated memory is still 176.2MB. Free memory was 122.3MB in the beginning and 111.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 928.87ms. Allocated memory is still 176.2MB. Free memory was 111.8MB in the beginning and 77.7MB in the end (delta: 34.0MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8043.48ms. Allocated memory was 176.2MB in the beginning and 343.9MB in the end (delta: 167.8MB). Free memory was 76.8MB in the beginning and 200.7MB in the end (delta: -123.9MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. * Witness Printer took 140.56ms. Allocated memory is still 343.9MB. Free memory was 200.7MB in the beginning and 189.1MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. 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: 155]: 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, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1097 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1097 mSDsluCounter, 1235 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 632 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4971 IncrementalHoareTripleChecker+Invalid, 5603 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 632 mSolverCounterUnsat, 1177 mSDtfsCounter, 4971 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2088occurred in iteration=12, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 1112 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2634 NumberOfCodeBlocks, 2634 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2621 ConstructedInterpolants, 0 QuantifiedInterpolants, 7606 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2274/2274 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: 592]: Loop Invariant Derived loop invariant: (((((((14 == a4) && (((long long) a1 + 551894) <= 0)) && (a12 == 0)) && (a19 == 6)) || ((((a19 <= 9) && (14 == a4)) && (a12 == 0)) && (a10 != 0))) || ((((a10 == 0) && (8 <= a19)) && (14 == a4)) && (a12 == 0))) || (((a10 == 1) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:15:35,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE