./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_label11.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_label11.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 05304907b173f35ae86ead9bea08abf85c97bbd94fd3cf389c54ce6fac582ae4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:57:40,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:57:40,125 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:40,129 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:57:40,130 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:57:40,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:57:40,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:57:40,166 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:57:40,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:57:40,168 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:57:40,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:57:40,168 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:57:40,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:57:40,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:57:40,173 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:57:40,174 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:57:40,174 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:57:40,174 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:57:40,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:57:40,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:57:40,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:57:40,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:57:40,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:57:40,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:57:40,176 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:57:40,176 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:57:40,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:57:40,178 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:57:40,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:57:40,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:57:40,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:57:40,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:57:40,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:57:40,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:57:40,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:57:40,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:57:40,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:57:40,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:57:40,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:57:40,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:57:40,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:57:40,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:57:40,182 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 -> 05304907b173f35ae86ead9bea08abf85c97bbd94fd3cf389c54ce6fac582ae4 [2024-10-12 15:57:40,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:57:40,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:57:40,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:57:40,454 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:57:40,455 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:57:40,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label11.c [2024-10-12 15:57:41,960 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:57:42,242 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:57:42,243 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label11.c [2024-10-12 15:57:42,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4afa82bc/09ca4e135be64422bebed7d42debdd30/FLAGebb57bab2 [2024-10-12 15:57:42,278 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4afa82bc/09ca4e135be64422bebed7d42debdd30 [2024-10-12 15:57:42,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:57:42,281 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:57:42,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:57:42,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:57:42,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:57:42,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:57:42" (1/1) ... [2024-10-12 15:57:42,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@436025e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:42, skipping insertion in model container [2024-10-12 15:57:42,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:57:42" (1/1) ... [2024-10-12 15:57:42,337 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:57:42,570 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_label11.c[6968,6981] [2024-10-12 15:57:42,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:57:42,718 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:57:42,757 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_label11.c[6968,6981] [2024-10-12 15:57:42,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:57:42,875 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:57:42,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:42 WrapperNode [2024-10-12 15:57:42,876 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:57:42,877 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:57:42,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:57:42,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:57:42,884 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:57:42" (1/1) ... [2024-10-12 15:57:42,907 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:57:42" (1/1) ... [2024-10-12 15:57:42,968 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-10-12 15:57:42,968 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:57:42,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:57:42,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:57:42,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:57:42,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:42" (1/1) ... [2024-10-12 15:57:42,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:42" (1/1) ... [2024-10-12 15:57:42,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:42" (1/1) ... [2024-10-12 15:57:43,038 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:57:43,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:42" (1/1) ... [2024-10-12 15:57:43,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:42" (1/1) ... [2024-10-12 15:57:43,054 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:42" (1/1) ... [2024-10-12 15:57:43,061 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:42" (1/1) ... [2024-10-12 15:57:43,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:42" (1/1) ... [2024-10-12 15:57:43,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:42" (1/1) ... [2024-10-12 15:57:43,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:57:43,077 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:57:43,077 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:57:43,077 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:57:43,079 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:42" (1/1) ... [2024-10-12 15:57:43,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:57:43,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:57:43,110 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:57:43,117 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:57:43,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:57:43,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:57:43,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:57:43,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:57:43,220 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:57:43,223 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:57:44,232 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-12 15:57:44,233 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:57:44,286 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:57:44,286 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:57:44,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:57:44 BoogieIcfgContainer [2024-10-12 15:57:44,287 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:57:44,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:57:44,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:57:44,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:57:44,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:57:42" (1/3) ... [2024-10-12 15:57:44,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@139abe0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:57:44, skipping insertion in model container [2024-10-12 15:57:44,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:42" (2/3) ... [2024-10-12 15:57:44,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@139abe0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:57:44, skipping insertion in model container [2024-10-12 15:57:44,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:57:44" (3/3) ... [2024-10-12 15:57:44,296 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label11.c [2024-10-12 15:57:44,312 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:57:44,313 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:57:44,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:57:44,388 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;@5b6425b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:57:44,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:57:44,392 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:57:44,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 15:57:44,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:57:44,402 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:57:44,428 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:57:44,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:57:44,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1990002702, now seen corresponding path program 1 times [2024-10-12 15:57:44,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:57:44,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868529135] [2024-10-12 15:57:44,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:57:44,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:57:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:57:44,685 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:57:44,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:57:44,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868529135] [2024-10-12 15:57:44,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868529135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:57:44,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:57:44,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:57:44,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443162103] [2024-10-12 15:57:44,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:57:44,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:57:44,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:57:44,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:57:44,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:57:44,727 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 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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:57:44,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:57:44,773 INFO L93 Difference]: Finished difference Result 287 states and 563 transitions. [2024-10-12 15:57:44,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:57:44,775 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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 60 [2024-10-12 15:57:44,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:57:44,787 INFO L225 Difference]: With dead ends: 287 [2024-10-12 15:57:44,787 INFO L226 Difference]: Without dead ends: 142 [2024-10-12 15:57:44,790 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:57:44,795 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:57:44,796 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:57:44,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-12 15:57:44,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-12 15:57:44,841 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:57:44,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-10-12 15:57:44,846 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 60 [2024-10-12 15:57:44,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:57:44,847 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-10-12 15:57:44,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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:57:44,847 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-10-12 15:57:44,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 15:57:44,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:57:44,849 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:57:44,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:57:44,850 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:57:44,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:57:44,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1366667874, now seen corresponding path program 1 times [2024-10-12 15:57:44,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:57:44,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769446311] [2024-10-12 15:57:44,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:57:44,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:57:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:57:45,125 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:57:45,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:57:45,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769446311] [2024-10-12 15:57:45,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769446311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:57:45,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:57:45,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:57:45,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582615960] [2024-10-12 15:57:45,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:57:45,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:57:45,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:57:45,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:57:45,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:57:45,130 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 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:57:45,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:57:45,710 INFO L93 Difference]: Finished difference Result 422 states and 648 transitions. [2024-10-12 15:57:45,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:57:45,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 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 60 [2024-10-12 15:57:45,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:57:45,713 INFO L225 Difference]: With dead ends: 422 [2024-10-12 15:57:45,713 INFO L226 Difference]: Without dead ends: 281 [2024-10-12 15:57:45,717 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:57:45,718 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 86 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 65 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.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:57:45,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 65 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:57:45,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-12 15:57:45,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-12 15:57:45,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.3428571428571427) internal successors, (376), 280 states have internal predecessors, (376), 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:57:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 376 transitions. [2024-10-12 15:57:45,752 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 376 transitions. Word has length 60 [2024-10-12 15:57:45,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:57:45,752 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 376 transitions. [2024-10-12 15:57:45,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 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:57:45,754 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 376 transitions. [2024-10-12 15:57:45,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-12 15:57:45,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:57:45,759 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:57:45,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:57:45,760 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:57:45,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:57:45,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1661583889, now seen corresponding path program 1 times [2024-10-12 15:57:45,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:57:45,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984751089] [2024-10-12 15:57:45,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:57:45,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:57:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:57:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:57:46,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:57:46,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984751089] [2024-10-12 15:57:46,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984751089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:57:46,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:57:46,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:57:46,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267688841] [2024-10-12 15:57:46,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:57:46,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:57:46,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:57:46,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:57:46,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:57:46,056 INFO L87 Difference]: Start difference. First operand 281 states and 376 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:57:46,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:57:46,587 INFO L93 Difference]: Finished difference Result 700 states and 966 transitions. [2024-10-12 15:57:46,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:57:46,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 126 [2024-10-12 15:57:46,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:57:46,591 INFO L225 Difference]: With dead ends: 700 [2024-10-12 15:57:46,595 INFO L226 Difference]: Without dead ends: 420 [2024-10-12 15:57:46,596 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:57:46,597 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 85 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:57:46,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 212 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:57:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-12 15:57:46,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-10-12 15:57:46,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.2529832935560858) internal successors, (525), 419 states have internal predecessors, (525), 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:57:46,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 525 transitions. [2024-10-12 15:57:46,623 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 525 transitions. Word has length 126 [2024-10-12 15:57:46,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:57:46,624 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 525 transitions. [2024-10-12 15:57:46,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:57:46,625 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 525 transitions. [2024-10-12 15:57:46,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-12 15:57:46,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:57:46,627 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:57:46,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:57:46,628 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:57:46,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:57:46,629 INFO L85 PathProgramCache]: Analyzing trace with hash 801381686, now seen corresponding path program 1 times [2024-10-12 15:57:46,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:57:46,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612461415] [2024-10-12 15:57:46,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:57:46,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:57:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:57:46,901 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:57:46,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:57:46,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612461415] [2024-10-12 15:57:46,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612461415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:57:46,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:57:46,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:57:46,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604648459] [2024-10-12 15:57:46,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:57:46,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:57:46,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:57:46,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:57:46,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:57:46,905 INFO L87 Difference]: Start difference. First operand 420 states and 525 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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:57:47,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:57:47,324 INFO L93 Difference]: Finished difference Result 978 states and 1208 transitions. [2024-10-12 15:57:47,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:57:47,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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 133 [2024-10-12 15:57:47,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:57:47,327 INFO L225 Difference]: With dead ends: 978 [2024-10-12 15:57:47,330 INFO L226 Difference]: Without dead ends: 559 [2024-10-12 15:57:47,331 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:57:47,332 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:57:47,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 75 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:57:47,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-12 15:57:47,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2024-10-12 15:57:47,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.2078853046594982) internal successors, (674), 558 states have internal predecessors, (674), 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:57:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 674 transitions. [2024-10-12 15:57:47,359 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 674 transitions. Word has length 133 [2024-10-12 15:57:47,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:57:47,360 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 674 transitions. [2024-10-12 15:57:47,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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:57:47,360 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 674 transitions. [2024-10-12 15:57:47,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-12 15:57:47,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:57:47,363 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:57:47,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:57:47,363 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:57:47,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:57:47,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1669300837, now seen corresponding path program 1 times [2024-10-12 15:57:47,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:57:47,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617499689] [2024-10-12 15:57:47,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:57:47,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:57:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:57:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:57:47,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:57:47,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617499689] [2024-10-12 15:57:47,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617499689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:57:47,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:57:47,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 15:57:47,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116827020] [2024-10-12 15:57:47,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:57:47,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 15:57:47,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:57:47,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 15:57:47,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:57:47,803 INFO L87 Difference]: Start difference. First operand 559 states and 674 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 6 states have internal predecessors, (135), 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:57:48,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:57:48,232 INFO L93 Difference]: Finished difference Result 1033 states and 1253 transitions. [2024-10-12 15:57:48,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 15:57:48,233 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 6 states have internal predecessors, (135), 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 135 [2024-10-12 15:57:48,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:57:48,236 INFO L225 Difference]: With dead ends: 1033 [2024-10-12 15:57:48,236 INFO L226 Difference]: Without dead ends: 559 [2024-10-12 15:57:48,237 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:57:48,238 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:57:48,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 17 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:57:48,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-12 15:57:48,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2024-10-12 15:57:48,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.2025089605734767) internal successors, (671), 558 states have internal predecessors, (671), 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:57:48,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 671 transitions. [2024-10-12 15:57:48,259 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 671 transitions. Word has length 135 [2024-10-12 15:57:48,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:57:48,259 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 671 transitions. [2024-10-12 15:57:48,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 6 states have internal predecessors, (135), 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:57:48,260 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 671 transitions. [2024-10-12 15:57:48,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 15:57:48,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:57:48,266 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:57:48,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:57:48,267 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:57:48,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:57:48,267 INFO L85 PathProgramCache]: Analyzing trace with hash -614240061, now seen corresponding path program 1 times [2024-10-12 15:57:48,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:57:48,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974290187] [2024-10-12 15:57:48,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:57:48,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:57:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:57:48,402 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:57:48,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:57:48,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974290187] [2024-10-12 15:57:48,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974290187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:57:48,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:57:48,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:57:48,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822537132] [2024-10-12 15:57:48,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:57:48,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:57:48,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:57:48,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:57:48,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:57:48,406 INFO L87 Difference]: Start difference. First operand 559 states and 671 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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:57:48,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:57:48,864 INFO L93 Difference]: Finished difference Result 1256 states and 1565 transitions. [2024-10-12 15:57:48,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:57:48,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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 151 [2024-10-12 15:57:48,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:57:48,870 INFO L225 Difference]: With dead ends: 1256 [2024-10-12 15:57:48,870 INFO L226 Difference]: Without dead ends: 837 [2024-10-12 15:57:48,871 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:57:48,871 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:57:48,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 32 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:57:48,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-12 15:57:48,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2024-10-12 15:57:48,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.1997607655502391) internal successors, (1003), 836 states have internal predecessors, (1003), 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:57:48,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1003 transitions. [2024-10-12 15:57:48,893 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1003 transitions. Word has length 151 [2024-10-12 15:57:48,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:57:48,893 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1003 transitions. [2024-10-12 15:57:48,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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:57:48,894 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1003 transitions. [2024-10-12 15:57:48,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-12 15:57:48,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:57:48,898 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:57:48,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:57:48,898 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:57:48,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:57:48,899 INFO L85 PathProgramCache]: Analyzing trace with hash 686356661, now seen corresponding path program 1 times [2024-10-12 15:57:48,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:57:48,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824217831] [2024-10-12 15:57:48,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:57:48,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:57:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:57:49,072 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:57:49,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:57:49,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824217831] [2024-10-12 15:57:49,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824217831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:57:49,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:57:49,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:57:49,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331670022] [2024-10-12 15:57:49,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:57:49,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:57:49,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:57:49,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:57:49,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:57:49,076 INFO L87 Difference]: Start difference. First operand 837 states and 1003 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:57:49,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:57:49,527 INFO L93 Difference]: Finished difference Result 1673 states and 2051 transitions. [2024-10-12 15:57:49,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:57:49,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2024-10-12 15:57:49,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:57:49,531 INFO L225 Difference]: With dead ends: 1673 [2024-10-12 15:57:49,532 INFO L226 Difference]: Without dead ends: 976 [2024-10-12 15:57:49,533 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:57:49,533 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 94 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:57:49,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 187 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:57:49,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-12 15:57:49,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2024-10-12 15:57:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.1456410256410257) internal successors, (1117), 975 states have internal predecessors, (1117), 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:57:49,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1117 transitions. [2024-10-12 15:57:49,549 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1117 transitions. Word has length 171 [2024-10-12 15:57:49,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:57:49,550 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1117 transitions. [2024-10-12 15:57:49,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:57:49,550 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1117 transitions. [2024-10-12 15:57:49,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-10-12 15:57:49,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:57:49,553 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 15:57:49,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:57:49,554 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:57:49,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:57:49,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1169437695, now seen corresponding path program 1 times [2024-10-12 15:57:49,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:57:49,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812041245] [2024-10-12 15:57:49,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:57:49,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:57:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:57:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-10-12 15:57:49,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:57:49,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812041245] [2024-10-12 15:57:49,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812041245] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:57:49,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498433229] [2024-10-12 15:57:49,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:57:49,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:57:49,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:57:49,937 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:57:49,940 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:57:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:57:50,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:57:50,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:57:50,450 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-10-12 15:57:50,451 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:57:50,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498433229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:57:50,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:57:50,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-12 15:57:50,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554211009] [2024-10-12 15:57:50,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:57:50,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:57:50,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:57:50,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:57:50,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:57:50,453 INFO L87 Difference]: Start difference. First operand 976 states and 1117 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:57:50,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:57:50,909 INFO L93 Difference]: Finished difference Result 1534 states and 1758 transitions. [2024-10-12 15:57:50,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:57:50,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 244 [2024-10-12 15:57:50,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:57:50,915 INFO L225 Difference]: With dead ends: 1534 [2024-10-12 15:57:50,916 INFO L226 Difference]: Without dead ends: 1532 [2024-10-12 15:57:50,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 243 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:57:50,917 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:57:50,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 9 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:57:50,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-10-12 15:57:50,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1115. [2024-10-12 15:57:50,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.1714542190305206) internal successors, (1305), 1114 states have internal predecessors, (1305), 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:57:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1305 transitions. [2024-10-12 15:57:50,940 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1305 transitions. Word has length 244 [2024-10-12 15:57:50,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:57:50,940 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1305 transitions. [2024-10-12 15:57:50,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:57:50,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1305 transitions. [2024-10-12 15:57:50,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-10-12 15:57:50,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:57:50,944 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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:57:50,965 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:57:51,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:57:51,146 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:57:51,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:57:51,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1101285217, now seen corresponding path program 1 times [2024-10-12 15:57:51,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:57:51,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110083494] [2024-10-12 15:57:51,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:57:51,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:57:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:57:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 79 proven. 38 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-12 15:57:51,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:57:51,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110083494] [2024-10-12 15:57:51,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110083494] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:57:51,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21293804] [2024-10-12 15:57:51,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:57:51,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:57:51,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:57:51,793 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:57:51,797 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:57:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:57:51,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:57:51,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:57:52,009 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-12 15:57:52,009 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:57:52,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21293804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:57:52,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:57:52,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-12 15:57:52,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688251687] [2024-10-12 15:57:52,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:57:52,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:57:52,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:57:52,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:57:52,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-12 15:57:52,011 INFO L87 Difference]: Start difference. First operand 1115 states and 1305 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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:57:52,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:57:52,456 INFO L93 Difference]: Finished difference Result 2368 states and 2843 transitions. [2024-10-12 15:57:52,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:57:52,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 308 [2024-10-12 15:57:52,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:57:52,461 INFO L225 Difference]: With dead ends: 2368 [2024-10-12 15:57:52,461 INFO L226 Difference]: Without dead ends: 1393 [2024-10-12 15:57:52,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-12 15:57:52,463 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 81 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:57:52,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 222 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:57:52,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-10-12 15:57:52,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1254. [2024-10-12 15:57:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.1644054269752593) internal successors, (1459), 1253 states have internal predecessors, (1459), 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:57:52,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1459 transitions. [2024-10-12 15:57:52,485 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1459 transitions. Word has length 308 [2024-10-12 15:57:52,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:57:52,485 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1459 transitions. [2024-10-12 15:57:52,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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:57:52,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1459 transitions. [2024-10-12 15:57:52,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-10-12 15:57:52,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:57:52,491 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:57:52,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 15:57:52,691 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,SelfDestructingSolverStorable8 [2024-10-12 15:57:52,692 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:57:52,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:57:52,692 INFO L85 PathProgramCache]: Analyzing trace with hash -527409794, now seen corresponding path program 1 times [2024-10-12 15:57:52,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:57:52,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171755513] [2024-10-12 15:57:52,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:57:52,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:57:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:57:53,031 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-10-12 15:57:53,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:57:53,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171755513] [2024-10-12 15:57:53,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171755513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:57:53,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:57:53,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:57:53,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893957447] [2024-10-12 15:57:53,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:57:53,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:57:53,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:57:53,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:57:53,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:57:53,033 INFO L87 Difference]: Start difference. First operand 1254 states and 1459 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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:57:53,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:57:53,562 INFO L93 Difference]: Finished difference Result 2227 states and 2584 transitions. [2024-10-12 15:57:53,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:57:53,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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 359 [2024-10-12 15:57:53,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:57:53,563 INFO L225 Difference]: With dead ends: 2227 [2024-10-12 15:57:53,563 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 15:57:53,565 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:57:53,566 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 90 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:57:53,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 22 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:57:53,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 15:57:53,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 15:57:53,567 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:57:53,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 15:57:53,568 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 359 [2024-10-12 15:57:53,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:57:53,568 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 15:57:53,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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:57:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 15:57:53,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 15:57:53,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:57:53,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 15:57:53,574 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:57:53,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 15:57:53,796 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:57:53,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:57:53 BoogieIcfgContainer [2024-10-12 15:57:53,814 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:57:53,815 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:57:53,815 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:57:53,816 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:57:53,816 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:57:44" (3/4) ... [2024-10-12 15:57:53,818 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 15:57:53,834 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-12 15:57:53,837 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 15:57:53,838 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 15:57:53,839 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 15:57:53,980 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:57:53,980 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 15:57:53,980 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:57:53,981 INFO L158 Benchmark]: Toolchain (without parser) took 11699.71ms. Allocated memory was 153.1MB in the beginning and 270.5MB in the end (delta: 117.4MB). Free memory was 94.5MB in the beginning and 162.1MB in the end (delta: -67.6MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. [2024-10-12 15:57:53,981 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 153.1MB. Free memory is still 113.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:57:53,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 593.67ms. Allocated memory was 153.1MB in the beginning and 216.0MB in the end (delta: 62.9MB). Free memory was 94.5MB in the beginning and 185.1MB in the end (delta: -90.6MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. [2024-10-12 15:57:53,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.30ms. Allocated memory is still 216.0MB. Free memory was 185.1MB in the beginning and 176.8MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 15:57:53,982 INFO L158 Benchmark]: Boogie Preprocessor took 106.75ms. Allocated memory is still 216.0MB. Free memory was 176.8MB in the beginning and 166.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 15:57:53,983 INFO L158 Benchmark]: RCFGBuilder took 1210.23ms. Allocated memory is still 216.0MB. Free memory was 166.3MB in the beginning and 67.7MB in the end (delta: 98.6MB). Peak memory consumption was 98.6MB. Max. memory is 16.1GB. [2024-10-12 15:57:53,983 INFO L158 Benchmark]: TraceAbstraction took 9524.41ms. Allocated memory was 216.0MB in the beginning and 270.5MB in the end (delta: 54.5MB). Free memory was 66.7MB in the beginning and 173.6MB in the end (delta: -106.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:57:53,983 INFO L158 Benchmark]: Witness Printer took 165.97ms. Allocated memory is still 270.5MB. Free memory was 173.6MB in the beginning and 162.1MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 15:57:53,985 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 153.1MB. Free memory is still 113.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 593.67ms. Allocated memory was 153.1MB in the beginning and 216.0MB in the end (delta: 62.9MB). Free memory was 94.5MB in the beginning and 185.1MB in the end (delta: -90.6MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.30ms. Allocated memory is still 216.0MB. Free memory was 185.1MB in the beginning and 176.8MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.75ms. Allocated memory is still 216.0MB. Free memory was 176.8MB in the beginning and 166.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1210.23ms. Allocated memory is still 216.0MB. Free memory was 166.3MB in the beginning and 67.7MB in the end (delta: 98.6MB). Peak memory consumption was 98.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9524.41ms. Allocated memory was 216.0MB in the beginning and 270.5MB in the end (delta: 54.5MB). Free memory was 66.7MB in the beginning and 173.6MB in the end (delta: -106.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 165.97ms. Allocated memory is still 270.5MB. Free memory was 173.6MB in the beginning and 162.1MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 197]: 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: 9.2s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 801 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 801 mSDsluCounter, 1058 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 498 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3378 IncrementalHoareTripleChecker+Invalid, 3876 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 498 mSolverCounterUnsat, 1018 mSDtfsCounter, 3378 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 583 GetRequests, 562 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1254occurred in iteration=9, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 556 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2299 NumberOfCodeBlocks, 2299 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2287 ConstructedInterpolants, 0 QuantifiedInterpolants, 8376 SizeOfPredicates, 0 NumberOfNonLiveVariables, 754 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 1427/1553 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: ((((((((a10 == 0) && (14 == a4)) && (a12 == 0)) || (((a19 == 9) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (4 <= a10)) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || (((a10 == 1) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (0 <= ((long long) a1 + 12))) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-12 15:57:54,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE