./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label16.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label16.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2464e957c33404298d60b891632e9df008614058c749595a2f9c32bf73970bbc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:36:16,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:36:16,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 18:36:16,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:36:16,381 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:36:16,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:36:16,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:36:16,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:36:16,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:36:16,409 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:36:16,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:36:16,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:36:16,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:36:16,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:36:16,411 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:36:16,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:36:16,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:36:16,412 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:36:16,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 18:36:16,413 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:36:16,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:36:16,418 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:36:16,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:36:16,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:36:16,423 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:36:16,424 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:36:16,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:36:16,424 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:36:16,424 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:36:16,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:36:16,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:36:16,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:36:16,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:36:16,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:36:16,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:36:16,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:36:16,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 18:36:16,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 18:36:16,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:36:16,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:36:16,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:36:16,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:36:16,428 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2464e957c33404298d60b891632e9df008614058c749595a2f9c32bf73970bbc [2024-11-09 18:36:16,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:36:16,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:36:16,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:36:16,755 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:36:16,756 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:36:16,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label16.c [2024-11-09 18:36:18,249 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:36:18,535 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:36:18,537 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label16.c [2024-11-09 18:36:18,560 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/201e69ddb/8d8abdcda2734cd8ba37c67d9bdc9c17/FLAG1ce57dbc5 [2024-11-09 18:36:18,845 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/201e69ddb/8d8abdcda2734cd8ba37c67d9bdc9c17 [2024-11-09 18:36:18,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:36:18,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:36:18,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:36:18,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:36:18,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:36:18,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:36:18" (1/1) ... [2024-11-09 18:36:18,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@592f888e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:18, skipping insertion in model container [2024-11-09 18:36:18,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:36:18" (1/1) ... [2024-11-09 18:36:18,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:36:19,261 WARN L250 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/Problem01_label16.c[21710,21723] [2024-11-09 18:36:19,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:36:19,313 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:36:19,392 WARN L250 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/Problem01_label16.c[21710,21723] [2024-11-09 18:36:19,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:36:19,418 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:36:19,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:19 WrapperNode [2024-11-09 18:36:19,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:36:19,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:36:19,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:36:19,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:36:19,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:19" (1/1) ... [2024-11-09 18:36:19,449 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:19" (1/1) ... [2024-11-09 18:36:19,513 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-09 18:36:19,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:36:19,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:36:19,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:36:19,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:36:19,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:19" (1/1) ... [2024-11-09 18:36:19,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:19" (1/1) ... [2024-11-09 18:36:19,530 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:19" (1/1) ... [2024-11-09 18:36:19,575 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-11-09 18:36:19,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:19" (1/1) ... [2024-11-09 18:36:19,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:19" (1/1) ... [2024-11-09 18:36:19,610 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:19" (1/1) ... [2024-11-09 18:36:19,614 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:19" (1/1) ... [2024-11-09 18:36:19,620 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:19" (1/1) ... [2024-11-09 18:36:19,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:19" (1/1) ... [2024-11-09 18:36:19,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:36:19,645 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:36:19,646 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:36:19,646 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:36:19,647 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:19" (1/1) ... [2024-11-09 18:36:19,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:36:19,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:36:19,689 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 18:36:19,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 18:36:19,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:36:19,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 18:36:19,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:36:19,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:36:19,856 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:36:19,859 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:36:20,849 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-09 18:36:20,850 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:36:20,882 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:36:20,883 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 18:36:20,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:36:20 BoogieIcfgContainer [2024-11-09 18:36:20,884 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:36:20,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:36:20,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:36:20,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:36:20,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:36:18" (1/3) ... [2024-11-09 18:36:20,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5d3584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:36:20, skipping insertion in model container [2024-11-09 18:36:20,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:36:19" (2/3) ... [2024-11-09 18:36:20,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5d3584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:36:20, skipping insertion in model container [2024-11-09 18:36:20,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:36:20" (3/3) ... [2024-11-09 18:36:20,895 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label16.c [2024-11-09 18:36:20,951 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:36:20,951 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:36:21,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:36:21,113 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;@43229f1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:36:21,113 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:36:21,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 199 states have (on average 1.6582914572864322) internal successors, (330), 200 states have internal predecessors, (330), 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-11-09 18:36:21,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 18:36:21,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:21,135 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, 1, 1, 1, 1, 1, 1] [2024-11-09 18:36:21,136 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:21,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:21,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1181094332, now seen corresponding path program 1 times [2024-11-09 18:36:21,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:21,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728295403] [2024-11-09 18:36:21,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:21,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:21,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:36:21,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:21,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728295403] [2024-11-09 18:36:21,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728295403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:21,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:21,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:36:21,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110053756] [2024-11-09 18:36:21,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:21,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:21,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:21,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:21,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:21,784 INFO L87 Difference]: Start difference. First operand has 201 states, 199 states have (on average 1.6582914572864322) internal successors, (330), 200 states have internal predecessors, (330), 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 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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-11-09 18:36:22,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:22,577 INFO L93 Difference]: Finished difference Result 534 states and 921 transitions. [2024-11-09 18:36:22,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:22,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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 132 [2024-11-09 18:36:22,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:22,597 INFO L225 Difference]: With dead ends: 534 [2024-11-09 18:36:22,597 INFO L226 Difference]: Without dead ends: 269 [2024-11-09 18:36:22,603 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-11-09 18:36:22,610 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 55 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:22,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 70 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 18:36:22,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-09 18:36:22,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-09 18:36:22,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 1.4291044776119404) internal successors, (383), 268 states have internal predecessors, (383), 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-11-09 18:36:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 383 transitions. [2024-11-09 18:36:22,672 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 383 transitions. Word has length 132 [2024-11-09 18:36:22,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:22,673 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 383 transitions. [2024-11-09 18:36:22,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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-11-09 18:36:22,674 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 383 transitions. [2024-11-09 18:36:22,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 18:36:22,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:22,677 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:36:22,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 18:36:22,678 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:22,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:22,679 INFO L85 PathProgramCache]: Analyzing trace with hash -192652554, now seen corresponding path program 1 times [2024-11-09 18:36:22,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:22,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012305098] [2024-11-09 18:36:22,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:22,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:36:22,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:22,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012305098] [2024-11-09 18:36:22,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012305098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:22,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:22,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:36:22,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868538741] [2024-11-09 18:36:22,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:22,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:22,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:22,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:22,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:22,831 INFO L87 Difference]: Start difference. First operand 269 states and 383 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 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-11-09 18:36:23,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:23,288 INFO L93 Difference]: Finished difference Result 800 states and 1143 transitions. [2024-11-09 18:36:23,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:23,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 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 138 [2024-11-09 18:36:23,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:23,292 INFO L225 Difference]: With dead ends: 800 [2024-11-09 18:36:23,294 INFO L226 Difference]: Without dead ends: 533 [2024-11-09 18:36:23,295 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-11-09 18:36:23,298 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 173 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:23,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 32 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:36:23,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-09 18:36:23,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2024-11-09 18:36:23,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 532 states have (on average 1.3646616541353382) internal successors, (726), 532 states have internal predecessors, (726), 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-11-09 18:36:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 726 transitions. [2024-11-09 18:36:23,344 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 726 transitions. Word has length 138 [2024-11-09 18:36:23,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:23,345 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 726 transitions. [2024-11-09 18:36:23,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 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-11-09 18:36:23,345 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 726 transitions. [2024-11-09 18:36:23,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-09 18:36:23,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:23,349 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:36:23,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 18:36:23,350 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:23,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:23,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2023481748, now seen corresponding path program 1 times [2024-11-09 18:36:23,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:23,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834930728] [2024-11-09 18:36:23,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:23,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:36:23,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:23,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834930728] [2024-11-09 18:36:23,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834930728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:23,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:23,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:36:23,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324527188] [2024-11-09 18:36:23,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:23,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:23,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:23,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:23,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:23,526 INFO L87 Difference]: Start difference. First operand 533 states and 726 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 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-11-09 18:36:23,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:23,963 INFO L93 Difference]: Finished difference Result 1460 states and 1973 transitions. [2024-11-09 18:36:23,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:23,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 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 142 [2024-11-09 18:36:23,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:23,968 INFO L225 Difference]: With dead ends: 1460 [2024-11-09 18:36:23,968 INFO L226 Difference]: Without dead ends: 929 [2024-11-09 18:36:23,969 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-11-09 18:36:23,971 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 140 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:23,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 39 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:36:23,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2024-11-09 18:36:24,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 929. [2024-11-09 18:36:24,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 928 states have (on average 1.2683189655172413) internal successors, (1177), 928 states have internal predecessors, (1177), 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-11-09 18:36:24,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1177 transitions. [2024-11-09 18:36:24,005 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1177 transitions. Word has length 142 [2024-11-09 18:36:24,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:24,006 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1177 transitions. [2024-11-09 18:36:24,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 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-11-09 18:36:24,006 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1177 transitions. [2024-11-09 18:36:24,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 18:36:24,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:24,009 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:36:24,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 18:36:24,010 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:24,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:24,011 INFO L85 PathProgramCache]: Analyzing trace with hash -213249566, now seen corresponding path program 1 times [2024-11-09 18:36:24,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:24,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564829188] [2024-11-09 18:36:24,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:24,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:36:24,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:24,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564829188] [2024-11-09 18:36:24,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564829188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:24,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:24,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:36:24,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424148817] [2024-11-09 18:36:24,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:24,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:24,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:24,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:24,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:24,290 INFO L87 Difference]: Start difference. First operand 929 states and 1177 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 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-11-09 18:36:24,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:24,691 INFO L93 Difference]: Finished difference Result 1856 states and 2352 transitions. [2024-11-09 18:36:24,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:24,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 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 146 [2024-11-09 18:36:24,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:24,695 INFO L225 Difference]: With dead ends: 1856 [2024-11-09 18:36:24,696 INFO L226 Difference]: Without dead ends: 929 [2024-11-09 18:36:24,697 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-11-09 18:36:24,698 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 134 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:24,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 59 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:36:24,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2024-11-09 18:36:24,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 929. [2024-11-09 18:36:24,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 928 states have (on average 1.2553879310344827) internal successors, (1165), 928 states have internal predecessors, (1165), 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-11-09 18:36:24,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1165 transitions. [2024-11-09 18:36:24,721 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1165 transitions. Word has length 146 [2024-11-09 18:36:24,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:24,722 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1165 transitions. [2024-11-09 18:36:24,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 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-11-09 18:36:24,722 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1165 transitions. [2024-11-09 18:36:24,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-09 18:36:24,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:24,727 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:36:24,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 18:36:24,728 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:24,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:24,728 INFO L85 PathProgramCache]: Analyzing trace with hash 93486871, now seen corresponding path program 1 times [2024-11-09 18:36:24,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:24,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490561094] [2024-11-09 18:36:24,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:24,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:24,885 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:36:24,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:24,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490561094] [2024-11-09 18:36:24,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490561094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:24,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:24,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:36:24,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788328378] [2024-11-09 18:36:24,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:24,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:24,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:24,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:24,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:24,888 INFO L87 Difference]: Start difference. First operand 929 states and 1165 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-11-09 18:36:25,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:25,331 INFO L93 Difference]: Finished difference Result 2516 states and 3141 transitions. [2024-11-09 18:36:25,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:25,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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 147 [2024-11-09 18:36:25,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:25,337 INFO L225 Difference]: With dead ends: 2516 [2024-11-09 18:36:25,337 INFO L226 Difference]: Without dead ends: 1589 [2024-11-09 18:36:25,339 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-11-09 18:36:25,340 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 135 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:25,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 35 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:36:25,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2024-11-09 18:36:25,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1457. [2024-11-09 18:36:25,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 1456 states have (on average 1.2451923076923077) internal successors, (1813), 1456 states have internal predecessors, (1813), 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-11-09 18:36:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 1813 transitions. [2024-11-09 18:36:25,370 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 1813 transitions. Word has length 147 [2024-11-09 18:36:25,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:25,370 INFO L471 AbstractCegarLoop]: Abstraction has 1457 states and 1813 transitions. [2024-11-09 18:36:25,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-11-09 18:36:25,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1813 transitions. [2024-11-09 18:36:25,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 18:36:25,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:25,374 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:36:25,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 18:36:25,374 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:25,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:25,375 INFO L85 PathProgramCache]: Analyzing trace with hash 93838749, now seen corresponding path program 1 times [2024-11-09 18:36:25,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:25,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964123811] [2024-11-09 18:36:25,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:25,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:36:25,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:25,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964123811] [2024-11-09 18:36:25,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964123811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:25,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:25,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:36:25,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270606790] [2024-11-09 18:36:25,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:25,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:25,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:25,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:25,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:25,616 INFO L87 Difference]: Start difference. First operand 1457 states and 1813 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 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-11-09 18:36:26,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:26,007 INFO L93 Difference]: Finished difference Result 2912 states and 3624 transitions. [2024-11-09 18:36:26,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:26,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 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-11-09 18:36:26,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:26,012 INFO L225 Difference]: With dead ends: 2912 [2024-11-09 18:36:26,013 INFO L226 Difference]: Without dead ends: 1457 [2024-11-09 18:36:26,014 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-11-09 18:36:26,015 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 122 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:26,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 66 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:36:26,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2024-11-09 18:36:26,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1457. [2024-11-09 18:36:26,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 1456 states have (on average 1.2328296703296704) internal successors, (1795), 1456 states have internal predecessors, (1795), 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-11-09 18:36:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 1795 transitions. [2024-11-09 18:36:26,040 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 1795 transitions. Word has length 148 [2024-11-09 18:36:26,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:26,041 INFO L471 AbstractCegarLoop]: Abstraction has 1457 states and 1795 transitions. [2024-11-09 18:36:26,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 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-11-09 18:36:26,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1795 transitions. [2024-11-09 18:36:26,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 18:36:26,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:26,044 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:36:26,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 18:36:26,044 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:26,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:26,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1430770184, now seen corresponding path program 1 times [2024-11-09 18:36:26,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:26,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273816271] [2024-11-09 18:36:26,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:26,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:26,288 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:36:26,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:26,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273816271] [2024-11-09 18:36:26,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273816271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:26,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:26,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:36:26,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661147534] [2024-11-09 18:36:26,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:26,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:36:26,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:26,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:36:26,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:36:26,291 INFO L87 Difference]: Start difference. First operand 1457 states and 1795 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:26,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:26,862 INFO L93 Difference]: Finished difference Result 3308 states and 4032 transitions. [2024-11-09 18:36:26,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:36:26,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2024-11-09 18:36:26,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:26,868 INFO L225 Difference]: With dead ends: 3308 [2024-11-09 18:36:26,868 INFO L226 Difference]: Without dead ends: 1853 [2024-11-09 18:36:26,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:36:26,871 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 380 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:26,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 64 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 18:36:26,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2024-11-09 18:36:26,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1721. [2024-11-09 18:36:26,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1720 states have (on average 1.211046511627907) internal successors, (2083), 1720 states have internal predecessors, (2083), 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-11-09 18:36:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2083 transitions. [2024-11-09 18:36:26,900 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2083 transitions. Word has length 153 [2024-11-09 18:36:26,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:26,900 INFO L471 AbstractCegarLoop]: Abstraction has 1721 states and 2083 transitions. [2024-11-09 18:36:26,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:36:26,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2083 transitions. [2024-11-09 18:36:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-09 18:36:26,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:26,903 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 18:36:26,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 18:36:26,904 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:26,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:26,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1592768166, now seen corresponding path program 1 times [2024-11-09 18:36:26,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:26,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911058946] [2024-11-09 18:36:26,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:26,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-09 18:36:27,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:27,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911058946] [2024-11-09 18:36:27,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911058946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:27,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:27,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:36:27,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981966832] [2024-11-09 18:36:27,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:27,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:27,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:27,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:27,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:36:27,114 INFO L87 Difference]: Start difference. First operand 1721 states and 2083 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 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-11-09 18:36:27,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:27,482 INFO L93 Difference]: Finished difference Result 2120 states and 2553 transitions. [2024-11-09 18:36:27,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:27,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 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 170 [2024-11-09 18:36:27,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:27,490 INFO L225 Difference]: With dead ends: 2120 [2024-11-09 18:36:27,491 INFO L226 Difference]: Without dead ends: 2117 [2024-11-09 18:36:27,492 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-11-09 18:36:27,493 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:27,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 35 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:36:27,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states. [2024-11-09 18:36:27,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 1589. [2024-11-09 18:36:27,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1588 states have (on average 1.2122166246851385) internal successors, (1925), 1588 states have internal predecessors, (1925), 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-11-09 18:36:27,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 1925 transitions. [2024-11-09 18:36:27,536 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 1925 transitions. Word has length 170 [2024-11-09 18:36:27,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:27,538 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 1925 transitions. [2024-11-09 18:36:27,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 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-11-09 18:36:27,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 1925 transitions. [2024-11-09 18:36:27,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-09 18:36:27,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:27,542 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 18:36:27,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 18:36:27,542 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:27,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:27,543 INFO L85 PathProgramCache]: Analyzing trace with hash -354940624, now seen corresponding path program 1 times [2024-11-09 18:36:27,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:27,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885558094] [2024-11-09 18:36:27,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:27,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:27,830 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-09 18:36:27,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:27,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885558094] [2024-11-09 18:36:27,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885558094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:27,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:36:27,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:36:27,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603751509] [2024-11-09 18:36:27,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:27,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:36:27,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:27,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:36:27,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:36:27,833 INFO L87 Difference]: Start difference. First operand 1589 states and 1925 transitions. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 3 states have internal predecessors, (184), 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-11-09 18:36:28,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:28,427 INFO L93 Difference]: Finished difference Result 3440 states and 4142 transitions. [2024-11-09 18:36:28,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:36:28,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 3 states have internal predecessors, (184), 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 228 [2024-11-09 18:36:28,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:28,436 INFO L225 Difference]: With dead ends: 3440 [2024-11-09 18:36:28,436 INFO L226 Difference]: Without dead ends: 1853 [2024-11-09 18:36:28,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:36:28,438 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 231 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:28,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 58 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 18:36:28,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2024-11-09 18:36:28,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1721. [2024-11-09 18:36:28,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1720 states have (on average 1.2063953488372092) internal successors, (2075), 1720 states have internal predecessors, (2075), 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-11-09 18:36:28,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2075 transitions. [2024-11-09 18:36:28,500 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2075 transitions. Word has length 228 [2024-11-09 18:36:28,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:28,500 INFO L471 AbstractCegarLoop]: Abstraction has 1721 states and 2075 transitions. [2024-11-09 18:36:28,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 3 states have internal predecessors, (184), 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-11-09 18:36:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2075 transitions. [2024-11-09 18:36:28,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-09 18:36:28,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:36:28,506 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 18:36:28,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 18:36:28,506 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:36:28,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:36:28,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1699741475, now seen corresponding path program 1 times [2024-11-09 18:36:28,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:36:28,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673649427] [2024-11-09 18:36:28,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:28,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:36:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:29,221 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 145 proven. 16 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-09 18:36:29,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:36:29,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673649427] [2024-11-09 18:36:29,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673649427] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:36:29,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49946834] [2024-11-09 18:36:29,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:36:29,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:36:29,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:36:29,226 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:36:29,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 18:36:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:36:29,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:36:29,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:36:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 18:36:29,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:36:29,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49946834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:36:29,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:36:29,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-09 18:36:29,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618872378] [2024-11-09 18:36:29,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:36:29,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:36:29,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:36:29,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:36:29,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:36:29,651 INFO L87 Difference]: Start difference. First operand 1721 states and 2075 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-11-09 18:36:30,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:36:30,032 INFO L93 Difference]: Finished difference Result 3437 states and 4146 transitions. [2024-11-09 18:36:30,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:36:30,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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 242 [2024-11-09 18:36:30,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:36:30,034 INFO L225 Difference]: With dead ends: 3437 [2024-11-09 18:36:30,034 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 18:36:30,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:36:30,039 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 8 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:36:30,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 193 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:36:30,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 18:36:30,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 18:36:30,039 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-11-09 18:36:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 18:36:30,040 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 242 [2024-11-09 18:36:30,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:36:30,040 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 18:36:30,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-11-09 18:36:30,040 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 18:36:30,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 18:36:30,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 18:36:30,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 18:36:30,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 18:36:30,251 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:36:30,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 18:36:30,399 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 18:36:30,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:36:30 BoogieIcfgContainer [2024-11-09 18:36:30,415 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 18:36:30,415 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 18:36:30,415 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 18:36:30,415 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 18:36:30,416 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:36:20" (3/4) ... [2024-11-09 18:36:30,418 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 18:36:30,439 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 18:36:30,440 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 18:36:30,441 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 18:36:30,441 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 18:36:30,595 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 18:36:30,595 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 18:36:30,596 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 18:36:30,597 INFO L158 Benchmark]: Toolchain (without parser) took 11747.55ms. Allocated memory was 159.4MB in the beginning and 287.3MB in the end (delta: 127.9MB). Free memory was 125.5MB in the beginning and 155.9MB in the end (delta: -30.4MB). Peak memory consumption was 98.6MB. Max. memory is 16.1GB. [2024-11-09 18:36:30,597 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:36:30,597 INFO L158 Benchmark]: CACSL2BoogieTranslator took 569.75ms. Allocated memory is still 159.4MB. Free memory was 125.5MB in the beginning and 95.1MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-09 18:36:30,598 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.73ms. Allocated memory is still 159.4MB. Free memory was 95.1MB in the beginning and 89.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 18:36:30,598 INFO L158 Benchmark]: Boogie Preprocessor took 130.51ms. Allocated memory is still 159.4MB. Free memory was 89.8MB in the beginning and 84.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 18:36:30,598 INFO L158 Benchmark]: IcfgBuilder took 1238.63ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 46.7MB in the end (delta: 37.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-09 18:36:30,598 INFO L158 Benchmark]: TraceAbstraction took 9527.55ms. Allocated memory was 159.4MB in the beginning and 287.3MB in the end (delta: 127.9MB). Free memory was 46.7MB in the beginning and 168.4MB in the end (delta: -121.7MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2024-11-09 18:36:30,599 INFO L158 Benchmark]: Witness Printer took 181.07ms. Allocated memory is still 287.3MB. Free memory was 168.4MB in the beginning and 155.9MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 18:36:30,600 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 569.75ms. Allocated memory is still 159.4MB. Free memory was 125.5MB in the beginning and 95.1MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.73ms. Allocated memory is still 159.4MB. Free memory was 95.1MB in the beginning and 89.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 130.51ms. Allocated memory is still 159.4MB. Free memory was 89.8MB in the beginning and 84.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1238.63ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 46.7MB in the end (delta: 37.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9527.55ms. Allocated memory was 159.4MB in the beginning and 287.3MB in the end (delta: 127.9MB). Free memory was 46.7MB in the beginning and 168.4MB in the end (delta: -121.7MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * Witness Printer took 181.07ms. Allocated memory is still 287.3MB. Free memory was 168.4MB in the beginning and 155.9MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 576]: 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, 201 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 10, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1402 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1402 mSDsluCounter, 651 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 621 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3818 IncrementalHoareTripleChecker+Invalid, 4439 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 621 mSolverCounterUnsat, 568 mSDtfsCounter, 3818 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 267 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1721occurred in iteration=7, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 924 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1888 NumberOfCodeBlocks, 1888 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1877 ConstructedInterpolants, 0 QuantifiedInterpolants, 4298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 449 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 753/769 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: 593]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 18:36:30,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE