./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_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label19.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d19293d6c97292eadc216d0bdf76553228738bf7b7f58bcd2246dd2ebdace18 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:57:57,229 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:57:57,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:57:57,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:57:57,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:57:57,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:57:57,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:57:57,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:57:57,342 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:57:57,343 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:57:57,343 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:57:57,344 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:57:57,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:57:57,345 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:57:57,347 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:57:57,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:57:57,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:57:57,348 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:57:57,348 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:57:57,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:57:57,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:57:57,349 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:57:57,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:57:57,350 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:57:57,350 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:57:57,350 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:57:57,351 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:57:57,351 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:57:57,351 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:57:57,351 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:57:57,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:57:57,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:57:57,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:57:57,352 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:57:57,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:57:57,353 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:57:57,353 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:57:57,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:57:57,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:57:57,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:57:57,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:57:57,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:57:57,355 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8d19293d6c97292eadc216d0bdf76553228738bf7b7f58bcd2246dd2ebdace18 [2024-10-12 15:57:57,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:57:57,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:57:57,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:57:57,688 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:57:57,688 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:57:57,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label19.c [2024-10-12 15:57:59,041 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:57:59,352 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:57:59,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label19.c [2024-10-12 15:57:59,378 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/160205295/df5a451dd52446d18dc59576ee242957/FLAG9cb7890a2 [2024-10-12 15:57:59,639 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/160205295/df5a451dd52446d18dc59576ee242957 [2024-10-12 15:57:59,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:57:59,642 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:57:59,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:57:59,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:57:59,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:57:59,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:57:59" (1/1) ... [2024-10-12 15:57:59,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@293ecbbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:59, skipping insertion in model container [2024-10-12 15:57:59,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:57:59" (1/1) ... [2024-10-12 15:57:59,705 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:57:59,925 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_label19.c[3486,3499] [2024-10-12 15:58:00,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:58:00,067 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:58:00,087 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_label19.c[3486,3499] [2024-10-12 15:58:00,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:58:00,177 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:58:00,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:00 WrapperNode [2024-10-12 15:58:00,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:58:00,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:58:00,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:58:00,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:58:00,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:00" (1/1) ... [2024-10-12 15:58:00,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:00" (1/1) ... [2024-10-12 15:58:00,267 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-10-12 15:58:00,268 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:58:00,269 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:58:00,269 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:58:00,269 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:58:00,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:00" (1/1) ... [2024-10-12 15:58:00,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:00" (1/1) ... [2024-10-12 15:58:00,287 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:00" (1/1) ... [2024-10-12 15:58:00,336 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 15:58:00,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:00" (1/1) ... [2024-10-12 15:58:00,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:00" (1/1) ... [2024-10-12 15:58:00,364 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:00" (1/1) ... [2024-10-12 15:58:00,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:00" (1/1) ... [2024-10-12 15:58:00,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:00" (1/1) ... [2024-10-12 15:58:00,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:00" (1/1) ... [2024-10-12 15:58:00,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:58:00,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:58:00,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:58:00,411 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:58:00,412 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:00" (1/1) ... [2024-10-12 15:58:00,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:58:00,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:58:00,450 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 15:58:00,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 15:58:00,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:58:00,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:58:00,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:58:00,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:58:00,608 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:58:00,610 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:58:01,724 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-12 15:58:01,724 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:58:01,785 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:58:01,786 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:58:01,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:58:01 BoogieIcfgContainer [2024-10-12 15:58:01,787 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:58:01,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:58:01,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:58:01,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:58:01,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:57:59" (1/3) ... [2024-10-12 15:58:01,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670bf307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:58:01, skipping insertion in model container [2024-10-12 15:58:01,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:58:00" (2/3) ... [2024-10-12 15:58:01,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670bf307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:58:01, skipping insertion in model container [2024-10-12 15:58:01,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:58:01" (3/3) ... [2024-10-12 15:58:01,797 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label19.c [2024-10-12 15:58:01,814 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:58:01,815 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:58:01,882 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:58:01,888 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;@b05660f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:58:01,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:58:01,893 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-12 15:58:01,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 15:58:01,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:01,900 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] [2024-10-12 15:58:01,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:01,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:01,906 INFO L85 PathProgramCache]: Analyzing trace with hash -240130059, now seen corresponding path program 1 times [2024-10-12 15:58:01,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:01,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218475175] [2024-10-12 15:58:01,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:01,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:02,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:02,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:02,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218475175] [2024-10-12 15:58:02,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218475175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:02,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:02,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:58:02,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402084048] [2024-10-12 15:58:02,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:02,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:58:02,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:02,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:58:02,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:58:02,169 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:02,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:02,216 INFO L93 Difference]: Finished difference Result 287 states and 563 transitions. [2024-10-12 15:58:02,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:58:02,219 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-12 15:58:02,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:02,230 INFO L225 Difference]: With dead ends: 287 [2024-10-12 15:58:02,230 INFO L226 Difference]: Without dead ends: 142 [2024-10-12 15:58:02,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:58:02,240 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-12 15:58:02,242 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-12 15:58:02,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-12 15:58:02,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-12 15:58:02,294 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-12 15:58:02,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-10-12 15:58:02,301 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 28 [2024-10-12 15:58:02,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:02,302 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-10-12 15:58:02,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:02,302 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-10-12 15:58:02,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 15:58:02,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:02,304 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] [2024-10-12 15:58:02,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:58:02,305 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:02,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:02,306 INFO L85 PathProgramCache]: Analyzing trace with hash 489842301, now seen corresponding path program 1 times [2024-10-12 15:58:02,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:02,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700803168] [2024-10-12 15:58:02,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:02,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:02,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:02,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700803168] [2024-10-12 15:58:02,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700803168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:02,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:02,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:58:02,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044598376] [2024-10-12 15:58:02,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:02,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:02,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:02,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:02,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:02,492 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:03,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:03,183 INFO L93 Difference]: Finished difference Result 283 states and 433 transitions. [2024-10-12 15:58:03,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:03,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-12 15:58:03,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:03,187 INFO L225 Difference]: With dead ends: 283 [2024-10-12 15:58:03,191 INFO L226 Difference]: Without dead ends: 281 [2024-10-12 15:58:03,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:03,192 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 123 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:03,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 9 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:58:03,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-12 15:58:03,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-12 15:58:03,218 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-12 15:58:03,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 431 transitions. [2024-10-12 15:58:03,221 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 431 transitions. Word has length 28 [2024-10-12 15:58:03,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:03,221 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 431 transitions. [2024-10-12 15:58:03,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:03,221 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 431 transitions. [2024-10-12 15:58:03,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 15:58:03,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:03,224 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:03,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:58:03,225 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:03,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:03,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1009330896, now seen corresponding path program 1 times [2024-10-12 15:58:03,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:03,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248843593] [2024-10-12 15:58:03,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:03,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 15:58:03,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:03,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248843593] [2024-10-12 15:58:03,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248843593] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:58:03,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857979874] [2024-10-12 15:58:03,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:03,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:58:03,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:58:03,638 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:58:03,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 15:58:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:03,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:58:03,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:58:03,828 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:03,830 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:58:03,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857979874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:03,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:58:03,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:58:03,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891220270] [2024-10-12 15:58:03,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:03,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:03,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:03,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:03,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:58:03,835 INFO L87 Difference]: Start difference. First operand 281 states and 431 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:04,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:04,434 INFO L93 Difference]: Finished difference Result 839 states and 1290 transitions. [2024-10-12 15:58:04,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:04,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2024-10-12 15:58:04,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:04,438 INFO L225 Difference]: With dead ends: 839 [2024-10-12 15:58:04,438 INFO L226 Difference]: Without dead ends: 559 [2024-10-12 15:58:04,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:58:04,440 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 113 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:04,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 223 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:58:04,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-12 15:58:04,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2024-10-12 15:58:04,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.3781362007168458) internal successors, (769), 558 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:04,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 769 transitions. [2024-10-12 15:58:04,462 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 769 transitions. Word has length 94 [2024-10-12 15:58:04,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:04,463 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 769 transitions. [2024-10-12 15:58:04,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:04,463 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 769 transitions. [2024-10-12 15:58:04,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-12 15:58:04,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:04,467 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:04,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 15:58:04,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:58:04,668 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:04,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:04,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1419037567, now seen corresponding path program 1 times [2024-10-12 15:58:04,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:04,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82780537] [2024-10-12 15:58:04,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:04,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:04,855 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:04,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:04,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82780537] [2024-10-12 15:58:04,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82780537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:04,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:04,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:58:04,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450670650] [2024-10-12 15:58:04,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:04,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:04,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:04,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:04,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:04,860 INFO L87 Difference]: Start difference. First operand 559 states and 769 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:05,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:05,366 INFO L93 Difference]: Finished difference Result 1395 states and 1966 transitions. [2024-10-12 15:58:05,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:05,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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 105 [2024-10-12 15:58:05,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:05,371 INFO L225 Difference]: With dead ends: 1395 [2024-10-12 15:58:05,371 INFO L226 Difference]: Without dead ends: 837 [2024-10-12 15:58:05,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:05,378 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 70 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:05,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 63 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:58:05,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-12 15:58:05,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2024-10-12 15:58:05,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.3014354066985645) internal successors, (1088), 836 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1088 transitions. [2024-10-12 15:58:05,416 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1088 transitions. Word has length 105 [2024-10-12 15:58:05,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:05,417 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1088 transitions. [2024-10-12 15:58:05,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:05,417 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1088 transitions. [2024-10-12 15:58:05,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-12 15:58:05,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:05,421 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:05,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:58:05,422 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:05,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:05,423 INFO L85 PathProgramCache]: Analyzing trace with hash -410264262, now seen corresponding path program 1 times [2024-10-12 15:58:05,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:05,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721404582] [2024-10-12 15:58:05,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:05,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:05,826 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:05,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:05,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721404582] [2024-10-12 15:58:05,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721404582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:05,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:05,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:58:05,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405144516] [2024-10-12 15:58:05,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:05,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:58:05,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:05,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:58:05,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:58:05,829 INFO L87 Difference]: Start difference. First operand 837 states and 1088 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 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-12 15:58:06,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:06,323 INFO L93 Difference]: Finished difference Result 1812 states and 2334 transitions. [2024-10-12 15:58:06,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:58:06,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 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-12 15:58:06,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:06,330 INFO L225 Difference]: With dead ends: 1812 [2024-10-12 15:58:06,330 INFO L226 Difference]: Without dead ends: 976 [2024-10-12 15:58:06,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:58:06,333 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:06,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 83 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:58:06,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-12 15:58:06,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2024-10-12 15:58:06,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.2635897435897436) internal successors, (1232), 975 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1232 transitions. [2024-10-12 15:58:06,356 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1232 transitions. Word has length 115 [2024-10-12 15:58:06,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:06,356 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1232 transitions. [2024-10-12 15:58:06,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 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-12 15:58:06,357 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1232 transitions. [2024-10-12 15:58:06,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 15:58:06,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:06,361 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:06,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:58:06,361 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:06,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:06,365 INFO L85 PathProgramCache]: Analyzing trace with hash -3695679, now seen corresponding path program 1 times [2024-10-12 15:58:06,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:06,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229295038] [2024-10-12 15:58:06,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:06,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:06,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:06,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229295038] [2024-10-12 15:58:06,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229295038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:06,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:06,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:58:06,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627085474] [2024-10-12 15:58:06,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:06,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:06,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:06,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:06,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:06,526 INFO L87 Difference]: Start difference. First operand 976 states and 1232 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:06,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:06,928 INFO L93 Difference]: Finished difference Result 2090 states and 2657 transitions. [2024-10-12 15:58:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:06,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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 172 [2024-10-12 15:58:06,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:06,938 INFO L225 Difference]: With dead ends: 2090 [2024-10-12 15:58:06,938 INFO L226 Difference]: Without dead ends: 1254 [2024-10-12 15:58:06,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:06,940 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 66 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:06,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 212 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:58:06,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-10-12 15:58:06,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1254. [2024-10-12 15:58:06,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.2210694333599361) internal successors, (1530), 1253 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:06,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1530 transitions. [2024-10-12 15:58:06,964 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1530 transitions. Word has length 172 [2024-10-12 15:58:06,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:06,964 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1530 transitions. [2024-10-12 15:58:06,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:06,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1530 transitions. [2024-10-12 15:58:06,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-12 15:58:06,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:06,968 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:58:06,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:58:06,969 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:06,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:06,969 INFO L85 PathProgramCache]: Analyzing trace with hash 712016203, now seen corresponding path program 1 times [2024-10-12 15:58:06,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:06,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599237772] [2024-10-12 15:58:06,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:06,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:07,272 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-12 15:58:07,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:07,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599237772] [2024-10-12 15:58:07,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599237772] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:58:07,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378389054] [2024-10-12 15:58:07,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:07,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:58:07,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:58:07,276 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:58:07,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 15:58:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:07,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:58:07,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:58:07,619 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-12 15:58:07,620 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:58:07,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378389054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:07,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:58:07,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-12 15:58:07,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333623039] [2024-10-12 15:58:07,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:07,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:07,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:07,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:07,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:58:07,622 INFO L87 Difference]: Start difference. First operand 1254 states and 1530 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:08,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:08,096 INFO L93 Difference]: Finished difference Result 2368 states and 2915 transitions. [2024-10-12 15:58:08,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:08,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 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 176 [2024-10-12 15:58:08,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:08,105 INFO L225 Difference]: With dead ends: 2368 [2024-10-12 15:58:08,106 INFO L226 Difference]: Without dead ends: 2366 [2024-10-12 15:58:08,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:58:08,107 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 69 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:08,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 69 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:58:08,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2024-10-12 15:58:08,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 976. [2024-10-12 15:58:08,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.243076923076923) internal successors, (1212), 975 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:08,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1212 transitions. [2024-10-12 15:58:08,152 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1212 transitions. Word has length 176 [2024-10-12 15:58:08,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:08,153 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1212 transitions. [2024-10-12 15:58:08,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:08,153 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1212 transitions. [2024-10-12 15:58:08,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-12 15:58:08,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:08,155 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:58:08,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 15:58:08,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-12 15:58:08,360 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:08,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:08,360 INFO L85 PathProgramCache]: Analyzing trace with hash 811899373, now seen corresponding path program 1 times [2024-10-12 15:58:08,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:08,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481452627] [2024-10-12 15:58:08,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:08,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:08,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:08,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481452627] [2024-10-12 15:58:08,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481452627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:08,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:08,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 15:58:08,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250562382] [2024-10-12 15:58:08,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:08,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 15:58:08,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:08,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 15:58:08,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:58:08,788 INFO L87 Difference]: Start difference. First operand 976 states and 1212 transitions. Second operand has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:09,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:09,441 INFO L93 Difference]: Finished difference Result 1867 states and 2334 transitions. [2024-10-12 15:58:09,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 15:58:09,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 6 states have internal predecessors, (181), 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-12 15:58:09,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:09,448 INFO L225 Difference]: With dead ends: 1867 [2024-10-12 15:58:09,448 INFO L226 Difference]: Without dead ends: 976 [2024-10-12 15:58:09,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:58:09,450 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:09,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 28 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:58:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-12 15:58:09,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2024-10-12 15:58:09,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.2379487179487179) internal successors, (1207), 975 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1207 transitions. [2024-10-12 15:58:09,468 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1207 transitions. Word has length 181 [2024-10-12 15:58:09,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:09,469 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1207 transitions. [2024-10-12 15:58:09,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:09,469 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1207 transitions. [2024-10-12 15:58:09,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-12 15:58:09,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:09,471 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:58:09,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 15:58:09,472 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:09,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:09,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1681667321, now seen corresponding path program 1 times [2024-10-12 15:58:09,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:09,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048565543] [2024-10-12 15:58:09,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:09,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:09,667 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:09,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:09,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048565543] [2024-10-12 15:58:09,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048565543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:09,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:09,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:58:09,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647209012] [2024-10-12 15:58:09,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:09,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:09,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:09,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:09,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:09,670 INFO L87 Difference]: Start difference. First operand 976 states and 1207 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 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-12 15:58:10,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:10,123 INFO L93 Difference]: Finished difference Result 1812 states and 2270 transitions. [2024-10-12 15:58:10,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:10,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 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) Word has length 217 [2024-10-12 15:58:10,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:10,127 INFO L225 Difference]: With dead ends: 1812 [2024-10-12 15:58:10,127 INFO L226 Difference]: Without dead ends: 976 [2024-10-12 15:58:10,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:10,129 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 75 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:10,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 187 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:58:10,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-12 15:58:10,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 837. [2024-10-12 15:58:10,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.1411483253588517) internal successors, (954), 836 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 954 transitions. [2024-10-12 15:58:10,147 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 954 transitions. Word has length 217 [2024-10-12 15:58:10,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:10,148 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 954 transitions. [2024-10-12 15:58:10,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 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-12 15:58:10,148 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 954 transitions. [2024-10-12 15:58:10,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-10-12 15:58:10,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:10,152 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:58:10,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 15:58:10,153 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:10,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:10,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1362245899, now seen corresponding path program 1 times [2024-10-12 15:58:10,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:10,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784348076] [2024-10-12 15:58:10,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:10,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:10,601 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 68 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:10,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:10,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784348076] [2024-10-12 15:58:10,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784348076] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:58:10,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306879254] [2024-10-12 15:58:10,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:10,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:58:10,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:58:10,604 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:58:10,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 15:58:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:10,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:58:10,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:58:10,990 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-12 15:58:10,993 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:58:10,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306879254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:10,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:58:10,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-12 15:58:10,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149607794] [2024-10-12 15:58:10,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:10,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:10,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:10,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:10,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:58:10,995 INFO L87 Difference]: Start difference. First operand 837 states and 954 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:11,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:11,428 INFO L93 Difference]: Finished difference Result 1812 states and 2096 transitions. [2024-10-12 15:58:11,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:11,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 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 261 [2024-10-12 15:58:11,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:11,433 INFO L225 Difference]: With dead ends: 1812 [2024-10-12 15:58:11,433 INFO L226 Difference]: Without dead ends: 1115 [2024-10-12 15:58:11,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:58:11,435 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 54 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:11,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 32 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:58:11,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2024-10-12 15:58:11,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2024-10-12 15:58:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.118491921005386) internal successors, (1246), 1114 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:11,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1246 transitions. [2024-10-12 15:58:11,453 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1246 transitions. Word has length 261 [2024-10-12 15:58:11,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:11,453 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1246 transitions. [2024-10-12 15:58:11,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1246 transitions. [2024-10-12 15:58:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-10-12 15:58:11,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:11,458 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12 15:58:11,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 15:58:11,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:58:11,659 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:11,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:11,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1976795987, now seen corresponding path program 1 times [2024-10-12 15:58:11,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:11,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766865182] [2024-10-12 15:58:11,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:11,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:11,898 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-12 15:58:11,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:11,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766865182] [2024-10-12 15:58:11,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766865182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:11,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:11,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:58:11,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826150190] [2024-10-12 15:58:11,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:11,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:11,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:11,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:11,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:11,900 INFO L87 Difference]: Start difference. First operand 1115 states and 1246 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:12,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:12,365 INFO L93 Difference]: Finished difference Result 2785 states and 3142 transitions. [2024-10-12 15:58:12,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:12,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 329 [2024-10-12 15:58:12,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:12,372 INFO L225 Difference]: With dead ends: 2785 [2024-10-12 15:58:12,372 INFO L226 Difference]: Without dead ends: 1810 [2024-10-12 15:58:12,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:12,375 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 21 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:12,375 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.4s Time] [2024-10-12 15:58:12,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2024-10-12 15:58:12,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1810. [2024-10-12 15:58:12,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1809 states have (on average 1.1033720287451632) internal successors, (1996), 1809 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:12,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 1996 transitions. [2024-10-12 15:58:12,407 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 1996 transitions. Word has length 329 [2024-10-12 15:58:12,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:12,408 INFO L471 AbstractCegarLoop]: Abstraction has 1810 states and 1996 transitions. [2024-10-12 15:58:12,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:12,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 1996 transitions. [2024-10-12 15:58:12,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-10-12 15:58:12,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:12,415 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12 15:58:12,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 15:58:12,415 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:12,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:12,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1166562929, now seen corresponding path program 1 times [2024-10-12 15:58:12,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:12,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043462541] [2024-10-12 15:58:12,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:12,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:12,821 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 17 proven. 63 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-10-12 15:58:12,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:12,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043462541] [2024-10-12 15:58:12,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043462541] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:58:12,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945793772] [2024-10-12 15:58:12,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:12,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:58:12,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:58:12,824 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:58:12,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 15:58:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:12,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:58:12,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:58:13,022 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-10-12 15:58:13,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:58:13,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945793772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:13,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:58:13,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 15:58:13,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323094162] [2024-10-12 15:58:13,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:13,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:13,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:13,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:13,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:58:13,027 INFO L87 Difference]: Start difference. First operand 1810 states and 1996 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:13,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:13,463 INFO L93 Difference]: Finished difference Result 3617 states and 4016 transitions. [2024-10-12 15:58:13,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:13,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 342 [2024-10-12 15:58:13,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:13,466 INFO L225 Difference]: With dead ends: 3617 [2024-10-12 15:58:13,466 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 15:58:13,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:58:13,469 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 113 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:13,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 219 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:58:13,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 15:58:13,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 15:58:13,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:13,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 15:58:13,472 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 342 [2024-10-12 15:58:13,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:13,472 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 15:58:13,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:13,472 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 15:58:13,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 15:58:13,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:58:13,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 15:58:13,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:58:13,683 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:13,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 15:58:13,856 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:58:13,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:58:13 BoogieIcfgContainer [2024-10-12 15:58:13,877 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:58:13,878 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:58:13,878 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:58:13,878 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:58:13,879 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:58:01" (3/4) ... [2024-10-12 15:58:13,881 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 15:58:13,896 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-12 15:58:13,897 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 15:58:13,898 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 15:58:13,899 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 15:58:14,046 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:58:14,049 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 15:58:14,050 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:58:14,051 INFO L158 Benchmark]: Toolchain (without parser) took 14408.10ms. Allocated memory was 176.2MB in the beginning and 314.6MB in the end (delta: 138.4MB). Free memory was 142.0MB in the beginning and 166.6MB in the end (delta: -24.7MB). Peak memory consumption was 114.7MB. Max. memory is 16.1GB. [2024-10-12 15:58:14,051 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:58:14,051 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.68ms. Allocated memory is still 176.2MB. Free memory was 141.8MB in the beginning and 119.4MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-12 15:58:14,051 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.64ms. Allocated memory is still 176.2MB. Free memory was 119.4MB in the beginning and 111.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 15:58:14,051 INFO L158 Benchmark]: Boogie Preprocessor took 141.18ms. Allocated memory is still 176.2MB. Free memory was 111.0MB in the beginning and 101.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 15:58:14,052 INFO L158 Benchmark]: RCFGBuilder took 1376.65ms. Allocated memory was 176.2MB in the beginning and 218.1MB in the end (delta: 41.9MB). Free memory was 101.6MB in the beginning and 160.3MB in the end (delta: -58.7MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2024-10-12 15:58:14,052 INFO L158 Benchmark]: TraceAbstraction took 12087.64ms. Allocated memory was 218.1MB in the beginning and 314.6MB in the end (delta: 96.5MB). Free memory was 159.3MB in the beginning and 179.2MB in the end (delta: -19.9MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2024-10-12 15:58:14,052 INFO L158 Benchmark]: Witness Printer took 171.68ms. Allocated memory is still 314.6MB. Free memory was 179.2MB in the beginning and 166.6MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 15:58:14,054 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.18ms. Allocated memory is still 176.2MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 534.68ms. Allocated memory is still 176.2MB. Free memory was 141.8MB in the beginning and 119.4MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.64ms. Allocated memory is still 176.2MB. Free memory was 119.4MB in the beginning and 111.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 141.18ms. Allocated memory is still 176.2MB. Free memory was 111.0MB in the beginning and 101.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1376.65ms. Allocated memory was 176.2MB in the beginning and 218.1MB in the end (delta: 41.9MB). Free memory was 101.6MB in the beginning and 160.3MB in the end (delta: -58.7MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12087.64ms. Allocated memory was 218.1MB in the beginning and 314.6MB in the end (delta: 96.5MB). Free memory was 159.3MB in the beginning and 179.2MB in the end (delta: -19.9MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. * Witness Printer took 171.68ms. Allocated memory is still 314.6MB. Free memory was 179.2MB in the beginning and 166.6MB in the end (delta: 12.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: 101]: 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: 11.8s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 973 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 973 mSDsluCounter, 1544 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 548 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4766 IncrementalHoareTripleChecker+Invalid, 5314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 548 mSolverCounterUnsat, 1483 mSDtfsCounter, 4766 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 909 GetRequests, 881 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1810occurred in iteration=11, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 1529 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 2921 NumberOfCodeBlocks, 2921 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2905 ConstructedInterpolants, 0 QuantifiedInterpolants, 11853 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1281 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 1835/2068 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: ((((((((a19 <= 9) && (2 <= a10)) && (14 == a4)) && (a12 == 0)) || ((((a10 == 0) && (14 == a4)) && (a12 == 0)) && (9 <= a19))) || ((((a10 == 0) && (a19 <= 6)) && (14 == a4)) && (a12 == 0))) || ((((a10 == 0) && (14 == a4)) && (a12 == 0)) && (23 <= a1))) || (((a10 == 1) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-12 15:58:14,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE