./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/Problem02_label18.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label18.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10ce6084b8eacd2d18483cb628f6c5abd6a714796c8d3c0285d28c3b447f089d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:34:49,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:34:49,265 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:34:49,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:34:49,271 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:34:49,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:34:49,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:34:49,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:34:49,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:34:49,305 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:34:49,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:34:49,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:34:49,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:34:49,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:34:49,307 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:34:49,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:34:49,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:34:49,308 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:34:49,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:34:49,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:34:49,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:34:49,313 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:34:49,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:34:49,314 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:34:49,314 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:34:49,314 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:34:49,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:34:49,315 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:34:49,315 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:34:49,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:34:49,316 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:34:49,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:34:49,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:34:49,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:34:49,320 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:34:49,320 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:34:49,320 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:34:49,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:34:49,321 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:34:49,321 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:34:49,321 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:34:49,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:34:49,322 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10ce6084b8eacd2d18483cb628f6c5abd6a714796c8d3c0285d28c3b447f089d [2024-10-10 22:34:49,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:34:49,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:34:49,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:34:49,618 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:34:49,619 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:34:49,620 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label18.c [2024-10-10 22:34:51,149 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:34:51,444 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:34:51,444 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label18.c [2024-10-10 22:34:51,461 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/58440d89e/eafb75b7f6b141828f0fb99b22e03060/FLAG15f4d09d4 [2024-10-10 22:34:51,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/58440d89e/eafb75b7f6b141828f0fb99b22e03060 [2024-10-10 22:34:51,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:34:51,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:34:51,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:34:51,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:34:51,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:34:51,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:34:51" (1/1) ... [2024-10-10 22:34:51,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e7d8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:51, skipping insertion in model container [2024-10-10 22:34:51,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:34:51" (1/1) ... [2024-10-10 22:34:51,544 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:34:51,873 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/Problem02_label18.c[19853,19866] [2024-10-10 22:34:51,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:34:51,953 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:34:52,061 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/Problem02_label18.c[19853,19866] [2024-10-10 22:34:52,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:34:52,089 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:34:52,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:52 WrapperNode [2024-10-10 22:34:52,090 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:34:52,091 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:34:52,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:34:52,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:34:52,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:52" (1/1) ... [2024-10-10 22:34:52,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:52" (1/1) ... [2024-10-10 22:34:52,158 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-10-10 22:34:52,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:34:52,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:34:52,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:34:52,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:34:52,176 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:52" (1/1) ... [2024-10-10 22:34:52,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:52" (1/1) ... [2024-10-10 22:34:52,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:52" (1/1) ... [2024-10-10 22:34:52,222 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 22:34:52,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:52" (1/1) ... [2024-10-10 22:34:52,226 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:52" (1/1) ... [2024-10-10 22:34:52,251 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:52" (1/1) ... [2024-10-10 22:34:52,263 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:52" (1/1) ... [2024-10-10 22:34:52,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:52" (1/1) ... [2024-10-10 22:34:52,279 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:52" (1/1) ... [2024-10-10 22:34:52,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:34:52,292 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:34:52,292 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:34:52,292 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:34:52,293 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:52" (1/1) ... [2024-10-10 22:34:52,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:34:52,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:34:52,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:34:52,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:34:52,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:34:52,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:34:52,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:34:52,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:34:52,424 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:34:52,426 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:34:53,374 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-10 22:34:53,374 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:34:53,438 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:34:53,440 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:34:53,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:34:53 BoogieIcfgContainer [2024-10-10 22:34:53,441 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:34:53,443 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:34:53,443 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:34:53,446 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:34:53,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:34:51" (1/3) ... [2024-10-10 22:34:53,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d7d6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:34:53, skipping insertion in model container [2024-10-10 22:34:53,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:52" (2/3) ... [2024-10-10 22:34:53,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d7d6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:34:53, skipping insertion in model container [2024-10-10 22:34:53,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:34:53" (3/3) ... [2024-10-10 22:34:53,449 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label18.c [2024-10-10 22:34:53,464 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:34:53,465 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:34:53,536 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:34:53,548 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;@2d115363, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:34:53,548 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:34:53,554 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:53,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-10 22:34:53,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:53,572 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:53,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:53,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:53,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1320933461, now seen corresponding path program 1 times [2024-10-10 22:34:53,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:53,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027726522] [2024-10-10 22:34:53,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:53,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:34:53,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:53,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027726522] [2024-10-10 22:34:53,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027726522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:53,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:53,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:34:53,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60590634] [2024-10-10 22:34:53,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:54,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:34:54,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:54,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:34:54,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:34:54,035 INFO L87 Difference]: Start difference. First operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 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 63.0) internal successors, (126), 2 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-10 22:34:54,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:54,083 INFO L93 Difference]: Finished difference Result 329 states and 625 transitions. [2024-10-10 22:34:54,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:34:54,085 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 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-10 22:34:54,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:54,100 INFO L225 Difference]: With dead ends: 329 [2024-10-10 22:34:54,100 INFO L226 Difference]: Without dead ends: 163 [2024-10-10 22:34:54,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:34:54,109 INFO L432 NwaCegarLoop]: 248 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, 248 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:54,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:34:54,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-10 22:34:54,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-10 22:34:54,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:54,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 248 transitions. [2024-10-10 22:34:54,163 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 248 transitions. Word has length 126 [2024-10-10 22:34:54,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:54,164 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 248 transitions. [2024-10-10 22:34:54,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 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-10 22:34:54,165 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 248 transitions. [2024-10-10 22:34:54,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-10 22:34:54,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:54,167 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:54,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:34:54,167 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:54,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:54,168 INFO L85 PathProgramCache]: Analyzing trace with hash -975950326, now seen corresponding path program 1 times [2024-10-10 22:34:54,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:54,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537740622] [2024-10-10 22:34:54,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:54,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:34:54,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:54,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537740622] [2024-10-10 22:34:54,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537740622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:54,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:54,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:34:54,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678711590] [2024-10-10 22:34:54,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:54,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:54,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:54,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:54,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:54,509 INFO L87 Difference]: Start difference. First operand 163 states and 248 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 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-10 22:34:55,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:55,072 INFO L93 Difference]: Finished difference Result 466 states and 712 transitions. [2024-10-10 22:34:55,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:55,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 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-10 22:34:55,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:55,076 INFO L225 Difference]: With dead ends: 466 [2024-10-10 22:34:55,076 INFO L226 Difference]: Without dead ends: 304 [2024-10-10 22:34:55,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:55,078 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 93 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:55,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 42 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:34:55,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-10 22:34:55,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2024-10-10 22:34:55,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.528052805280528) internal successors, (463), 303 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:55,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 463 transitions. [2024-10-10 22:34:55,113 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 463 transitions. Word has length 126 [2024-10-10 22:34:55,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:55,115 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 463 transitions. [2024-10-10 22:34:55,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 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-10 22:34:55,115 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 463 transitions. [2024-10-10 22:34:55,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-10 22:34:55,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:55,118 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:55,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:34:55,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:55,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:55,119 INFO L85 PathProgramCache]: Analyzing trace with hash -506189792, now seen corresponding path program 1 times [2024-10-10 22:34:55,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:55,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076876696] [2024-10-10 22:34:55,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:55,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:55,351 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:34:55,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:55,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076876696] [2024-10-10 22:34:55,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076876696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:55,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:55,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:34:55,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053499644] [2024-10-10 22:34:55,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:55,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:55,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:55,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:55,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:55,357 INFO L87 Difference]: Start difference. First operand 304 states and 463 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:55,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:55,848 INFO L93 Difference]: Finished difference Result 899 states and 1373 transitions. [2024-10-10 22:34:55,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:55,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 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 137 [2024-10-10 22:34:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:55,854 INFO L225 Difference]: With dead ends: 899 [2024-10-10 22:34:55,854 INFO L226 Difference]: Without dead ends: 596 [2024-10-10 22:34:55,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:55,860 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 191 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:55,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 70 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:34:55,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-10-10 22:34:55,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 455. [2024-10-10 22:34:55,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 1.4911894273127753) internal successors, (677), 454 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:55,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 677 transitions. [2024-10-10 22:34:55,895 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 677 transitions. Word has length 137 [2024-10-10 22:34:55,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:55,896 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 677 transitions. [2024-10-10 22:34:55,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:55,896 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 677 transitions. [2024-10-10 22:34:55,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-10 22:34:55,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:55,901 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:55,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:34:55,901 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:55,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:55,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1947872215, now seen corresponding path program 1 times [2024-10-10 22:34:55,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:55,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475315458] [2024-10-10 22:34:55,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:55,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:56,114 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:34:56,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:56,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475315458] [2024-10-10 22:34:56,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475315458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:56,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:56,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:34:56,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653631211] [2024-10-10 22:34:56,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:56,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:56,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:56,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:56,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:56,118 INFO L87 Difference]: Start difference. First operand 455 states and 677 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:56,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:56,558 INFO L93 Difference]: Finished difference Result 1351 states and 2015 transitions. [2024-10-10 22:34:56,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:56,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 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 144 [2024-10-10 22:34:56,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:56,567 INFO L225 Difference]: With dead ends: 1351 [2024-10-10 22:34:56,567 INFO L226 Difference]: Without dead ends: 897 [2024-10-10 22:34:56,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:56,572 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 158 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:56,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 121 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:34:56,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2024-10-10 22:34:56,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 888. [2024-10-10 22:34:56,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 887 states have (on average 1.4396843291995491) internal successors, (1277), 887 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:56,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1277 transitions. [2024-10-10 22:34:56,598 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1277 transitions. Word has length 144 [2024-10-10 22:34:56,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:56,598 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1277 transitions. [2024-10-10 22:34:56,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:56,599 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1277 transitions. [2024-10-10 22:34:56,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-10 22:34:56,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:56,602 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:56,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:34:56,603 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:56,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:56,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1344641890, now seen corresponding path program 1 times [2024-10-10 22:34:56,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:56,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430019735] [2024-10-10 22:34:56,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:56,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:56,876 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-10 22:34:56,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:56,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430019735] [2024-10-10 22:34:56,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430019735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:56,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:56,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:34:56,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291439998] [2024-10-10 22:34:56,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:56,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:56,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:56,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:56,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:56,879 INFO L87 Difference]: Start difference. First operand 888 states and 1277 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:57,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:57,333 INFO L93 Difference]: Finished difference Result 2200 states and 3178 transitions. [2024-10-10 22:34:57,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:57,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 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 148 [2024-10-10 22:34:57,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:57,338 INFO L225 Difference]: With dead ends: 2200 [2024-10-10 22:34:57,338 INFO L226 Difference]: Without dead ends: 1313 [2024-10-10 22:34:57,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:57,344 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 143 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:57,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 120 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:34:57,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2024-10-10 22:34:57,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1171. [2024-10-10 22:34:57,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 1170 states have (on average 1.3547008547008548) internal successors, (1585), 1170 states have internal predecessors, (1585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:57,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1585 transitions. [2024-10-10 22:34:57,375 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1585 transitions. Word has length 148 [2024-10-10 22:34:57,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:57,375 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 1585 transitions. [2024-10-10 22:34:57,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:57,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1585 transitions. [2024-10-10 22:34:57,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-10 22:34:57,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:57,380 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:57,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:34:57,381 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:57,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:57,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1439085701, now seen corresponding path program 1 times [2024-10-10 22:34:57,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:57,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809217761] [2024-10-10 22:34:57,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:57,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:57,657 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-10 22:34:57,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:57,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809217761] [2024-10-10 22:34:57,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809217761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:57,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:57,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:34:57,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982820233] [2024-10-10 22:34:57,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:57,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:57,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:57,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:57,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:57,659 INFO L87 Difference]: Start difference. First operand 1171 states and 1585 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:58,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:58,136 INFO L93 Difference]: Finished difference Result 3188 states and 4395 transitions. [2024-10-10 22:34:58,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:58,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 153 [2024-10-10 22:34:58,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:58,143 INFO L225 Difference]: With dead ends: 3188 [2024-10-10 22:34:58,143 INFO L226 Difference]: Without dead ends: 2018 [2024-10-10 22:34:58,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:58,146 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 146 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:58,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 246 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:34:58,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2024-10-10 22:34:58,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 2013. [2024-10-10 22:34:58,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2013 states, 2012 states have (on average 1.2519880715705765) internal successors, (2519), 2012 states have internal predecessors, (2519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 2013 states and 2519 transitions. [2024-10-10 22:34:58,183 INFO L78 Accepts]: Start accepts. Automaton has 2013 states and 2519 transitions. Word has length 153 [2024-10-10 22:34:58,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:58,183 INFO L471 AbstractCegarLoop]: Abstraction has 2013 states and 2519 transitions. [2024-10-10 22:34:58,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:58,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 2519 transitions. [2024-10-10 22:34:58,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-10 22:34:58,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:58,188 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:58,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:34:58,188 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:58,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:58,189 INFO L85 PathProgramCache]: Analyzing trace with hash 520195162, now seen corresponding path program 1 times [2024-10-10 22:34:58,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:58,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372500846] [2024-10-10 22:34:58,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:58,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:58,537 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:34:58,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:58,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372500846] [2024-10-10 22:34:58,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372500846] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:34:58,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397848195] [2024-10-10 22:34:58,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:58,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:34:58,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:34:58,542 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:34:58,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:34:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:58,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:34:58,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:34:58,871 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:34:58,871 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:34:58,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397848195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:58,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:34:58,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 22:34:58,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102432999] [2024-10-10 22:34:58,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:58,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:58,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:58,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:58,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:34:58,874 INFO L87 Difference]: Start difference. First operand 2013 states and 2519 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:59,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:59,353 INFO L93 Difference]: Finished difference Result 5010 states and 6235 transitions. [2024-10-10 22:34:59,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:59,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 153 [2024-10-10 22:34:59,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:59,365 INFO L225 Difference]: With dead ends: 5010 [2024-10-10 22:34:59,365 INFO L226 Difference]: Without dead ends: 2998 [2024-10-10 22:34:59,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:34:59,369 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 44 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:59,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 84 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:34:59,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2024-10-10 22:34:59,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2293. [2024-10-10 22:34:59,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2293 states, 2292 states have (on average 1.2159685863874345) internal successors, (2787), 2292 states have internal predecessors, (2787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:59,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 2787 transitions. [2024-10-10 22:34:59,413 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 2787 transitions. Word has length 153 [2024-10-10 22:34:59,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:59,414 INFO L471 AbstractCegarLoop]: Abstraction has 2293 states and 2787 transitions. [2024-10-10 22:34:59,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:59,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 2787 transitions. [2024-10-10 22:34:59,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-10 22:34:59,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:59,420 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:59,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 22:34:59,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:34:59,625 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:59,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:59,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1798864720, now seen corresponding path program 1 times [2024-10-10 22:34:59,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:59,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552256313] [2024-10-10 22:34:59,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:59,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:59,735 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-10 22:34:59,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:59,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552256313] [2024-10-10 22:34:59,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552256313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:59,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:59,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:34:59,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498723053] [2024-10-10 22:34:59,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:59,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:59,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:59,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:59,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:59,738 INFO L87 Difference]: Start difference. First operand 2293 states and 2787 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:00,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:00,211 INFO L93 Difference]: Finished difference Result 5562 states and 6796 transitions. [2024-10-10 22:35:00,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:00,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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 209 [2024-10-10 22:35:00,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:00,212 INFO L225 Difference]: With dead ends: 5562 [2024-10-10 22:35:00,212 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 22:35:00,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:00,218 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 188 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:00,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 72 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:35:00,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 22:35:00,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 22:35:00,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:00,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 22:35:00,219 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 209 [2024-10-10 22:35:00,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:00,220 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 22:35:00,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:00,220 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 22:35:00,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 22:35:00,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:35:00,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 22:35:00,226 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:00,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 22:35:00,318 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:35:00,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:35:00 BoogieIcfgContainer [2024-10-10 22:35:00,336 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:35:00,337 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:35:00,337 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:35:00,337 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:35:00,338 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:34:53" (3/4) ... [2024-10-10 22:35:00,340 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 22:35:00,365 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 22:35:00,366 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 22:35:00,367 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 22:35:00,368 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 22:35:00,511 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 22:35:00,511 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 22:35:00,512 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:35:00,513 INFO L158 Benchmark]: Toolchain (without parser) took 9027.80ms. Allocated memory was 184.5MB in the beginning and 230.7MB in the end (delta: 46.1MB). Free memory was 115.0MB in the beginning and 135.9MB in the end (delta: -21.0MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2024-10-10 22:35:00,513 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 113.2MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:35:00,516 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.68ms. Allocated memory is still 184.5MB. Free memory was 114.7MB in the beginning and 143.4MB in the end (delta: -28.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-10 22:35:00,516 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.23ms. Allocated memory is still 184.5MB. Free memory was 143.4MB in the beginning and 137.9MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-10 22:35:00,517 INFO L158 Benchmark]: Boogie Preprocessor took 130.65ms. Allocated memory is still 184.5MB. Free memory was 137.9MB in the beginning and 133.0MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-10 22:35:00,517 INFO L158 Benchmark]: RCFGBuilder took 1149.17ms. Allocated memory is still 184.5MB. Free memory was 133.0MB in the beginning and 117.2MB in the end (delta: 15.8MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. [2024-10-10 22:35:00,517 INFO L158 Benchmark]: TraceAbstraction took 6893.63ms. Allocated memory was 184.5MB in the beginning and 230.7MB in the end (delta: 46.1MB). Free memory was 117.2MB in the beginning and 148.5MB in the end (delta: -31.3MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-10-10 22:35:00,517 INFO L158 Benchmark]: Witness Printer took 174.72ms. Allocated memory is still 230.7MB. Free memory was 148.5MB in the beginning and 135.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 22:35:00,519 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.21ms. Allocated memory is still 113.2MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 603.68ms. Allocated memory is still 184.5MB. Free memory was 114.7MB in the beginning and 143.4MB in the end (delta: -28.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.23ms. Allocated memory is still 184.5MB. Free memory was 143.4MB in the beginning and 137.9MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 130.65ms. Allocated memory is still 184.5MB. Free memory was 137.9MB in the beginning and 133.0MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1149.17ms. Allocated memory is still 184.5MB. Free memory was 133.0MB in the beginning and 117.2MB in the end (delta: 15.8MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6893.63ms. Allocated memory was 184.5MB in the beginning and 230.7MB in the end (delta: 46.1MB). Free memory was 117.2MB in the beginning and 148.5MB in the end (delta: -31.3MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Witness Printer took 174.72ms. Allocated memory is still 230.7MB. Free memory was 148.5MB in the beginning and 135.9MB in the end (delta: 12.6MB). 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: 563]: 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, 165 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 963 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 963 mSDsluCounter, 1003 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107 mSDsCounter, 495 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2615 IncrementalHoareTripleChecker+Invalid, 3110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 495 mSolverCounterUnsat, 896 mSDtfsCounter, 2615 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2293occurred in iteration=7, InterpolantAutomatonStates: 23, 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, 8 MinimizatonAttempts, 1002 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1349 NumberOfCodeBlocks, 1349 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1340 ConstructedInterpolants, 0 QuantifiedInterpolants, 3740 SizeOfPredicates, 0 NumberOfNonLiveVariables, 278 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 229/245 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: 616]: Loop Invariant Derived loop invariant: ((((((a11 == 0) && (a19 == 1)) || ((a25 != 1) && (a19 == 1))) || ((a11 == 0) && (a25 == 0))) || (a28 < 11)) || ((8 <= a17) && (a19 == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-10 22:35:00,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE