./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label01.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/Problem14_label01.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 1c37d32a33cb40c9afe6e04b3666819154b9d70eb1819b42c10fde7907ef957d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:36:11,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:36:11,749 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:36:11,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:36:11,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:36:11,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:36:11,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:36:11,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:36:11,786 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:36:11,790 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:36:11,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:36:11,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:36:11,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:36:11,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:36:11,791 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:36:11,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:36:11,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:36:11,792 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:36:11,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:36:11,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:36:11,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:36:11,796 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:36:11,796 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:36:11,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:36:11,796 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:36:11,797 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:36:11,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:36:11,797 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:36:11,798 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:36:11,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:36:11,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:36:11,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:36:11,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:36:11,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:36:11,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:36:11,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:36:11,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:36:11,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:36:11,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:36:11,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:36:11,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:36:11,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:36:11,802 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 -> 1c37d32a33cb40c9afe6e04b3666819154b9d70eb1819b42c10fde7907ef957d [2024-11-09 19:36:12,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:36:12,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:36:12,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:36:12,093 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:36:12,094 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:36:12,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label01.c [2024-11-09 19:36:13,457 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:36:13,719 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:36:13,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label01.c [2024-11-09 19:36:13,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/730bb7805/c5781f277b394072b80a3139ea334ff2/FLAG8bd0867db [2024-11-09 19:36:13,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/730bb7805/c5781f277b394072b80a3139ea334ff2 [2024-11-09 19:36:13,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:36:13,767 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:36:13,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:36:13,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:36:13,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:36:13,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:36:13" (1/1) ... [2024-11-09 19:36:13,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c86cd88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:13, skipping insertion in model container [2024-11-09 19:36:13,777 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:36:13" (1/1) ... [2024-11-09 19:36:13,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:36:14,059 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/Problem14_label01.c[5556,5569] [2024-11-09 19:36:14,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:36:14,235 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:36:14,273 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/Problem14_label01.c[5556,5569] [2024-11-09 19:36:14,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:36:14,385 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:36:14,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:14 WrapperNode [2024-11-09 19:36:14,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:36:14,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:36:14,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:36:14,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:36:14,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:14" (1/1) ... [2024-11-09 19:36:14,416 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:14" (1/1) ... [2024-11-09 19:36:14,484 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 858 [2024-11-09 19:36:14,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:36:14,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:36:14,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:36:14,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:36:14,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:14" (1/1) ... [2024-11-09 19:36:14,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:14" (1/1) ... [2024-11-09 19:36:14,503 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:14" (1/1) ... [2024-11-09 19:36:14,542 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 19:36:14,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:14" (1/1) ... [2024-11-09 19:36:14,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:14" (1/1) ... [2024-11-09 19:36:14,576 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:14" (1/1) ... [2024-11-09 19:36:14,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:14" (1/1) ... [2024-11-09 19:36:14,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:14" (1/1) ... [2024-11-09 19:36:14,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:14" (1/1) ... [2024-11-09 19:36:14,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:36:14,612 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:36:14,612 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:36:14,612 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:36:14,613 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:14" (1/1) ... [2024-11-09 19:36:14,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:36:14,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:36:14,650 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 19:36:14,655 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 19:36:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:36:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:36:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:36:14,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:36:14,787 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:36:14,789 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:36:16,239 INFO L? ?]: Removed 236 outVars from TransFormulas that were not future-live. [2024-11-09 19:36:16,239 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:36:16,257 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:36:16,259 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:36:16,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:36:16 BoogieIcfgContainer [2024-11-09 19:36:16,260 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:36:16,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:36:16,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:36:16,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:36:16,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:36:13" (1/3) ... [2024-11-09 19:36:16,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b5405d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:36:16, skipping insertion in model container [2024-11-09 19:36:16,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:14" (2/3) ... [2024-11-09 19:36:16,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b5405d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:36:16, skipping insertion in model container [2024-11-09 19:36:16,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:36:16" (3/3) ... [2024-11-09 19:36:16,268 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label01.c [2024-11-09 19:36:16,283 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:36:16,283 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:36:16,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:36:16,377 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;@298f9147, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:36:16,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:36:16,382 INFO L276 IsEmpty]: Start isEmpty. Operand has 248 states, 246 states have (on average 2.186991869918699) internal successors, (538), 247 states have internal predecessors, (538), 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 19:36:16,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 19:36:16,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:16,391 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] [2024-11-09 19:36:16,392 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:16,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:16,396 INFO L85 PathProgramCache]: Analyzing trace with hash 120534320, now seen corresponding path program 1 times [2024-11-09 19:36:16,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:16,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37733790] [2024-11-09 19:36:16,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:16,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:16,873 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 19:36:16,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:16,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37733790] [2024-11-09 19:36:16,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37733790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:16,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:36:16,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:36:16,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000982189] [2024-11-09 19:36:16,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:16,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:36:16,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:16,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:36:16,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:36:16,911 INFO L87 Difference]: Start difference. First operand has 248 states, 246 states have (on average 2.186991869918699) internal successors, (538), 247 states have internal predecessors, (538), 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 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 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 19:36:18,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:18,911 INFO L93 Difference]: Finished difference Result 859 states and 2019 transitions. [2024-11-09 19:36:18,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:36:18,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 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 56 [2024-11-09 19:36:18,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:18,937 INFO L225 Difference]: With dead ends: 859 [2024-11-09 19:36:18,937 INFO L226 Difference]: Without dead ends: 542 [2024-11-09 19:36:18,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:36:18,947 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 840 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1781 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 1781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:18,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 199 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 1781 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 19:36:18,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-09 19:36:19,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2024-11-09 19:36:19,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 2.0720887245841033) internal successors, (1121), 541 states have internal predecessors, (1121), 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 19:36:19,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1121 transitions. [2024-11-09 19:36:19,066 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1121 transitions. Word has length 56 [2024-11-09 19:36:19,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:19,067 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 1121 transitions. [2024-11-09 19:36:19,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 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 19:36:19,067 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1121 transitions. [2024-11-09 19:36:19,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 19:36:19,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:19,071 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:36:19,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:36:19,072 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:19,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:19,073 INFO L85 PathProgramCache]: Analyzing trace with hash -84305644, now seen corresponding path program 1 times [2024-11-09 19:36:19,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:19,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29309138] [2024-11-09 19:36:19,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:19,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:19,258 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:36:19,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:19,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29309138] [2024-11-09 19:36:19,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29309138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:19,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:36:19,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:36:19,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385324175] [2024-11-09 19:36:19,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:19,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:36:19,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:19,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:36:19,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:36:19,266 INFO L87 Difference]: Start difference. First operand 542 states and 1121 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 19:36:20,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:20,142 INFO L93 Difference]: Finished difference Result 1082 states and 2342 transitions. [2024-11-09 19:36:20,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:36:20,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 123 [2024-11-09 19:36:20,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:20,147 INFO L225 Difference]: With dead ends: 1082 [2024-11-09 19:36:20,147 INFO L226 Difference]: Without dead ends: 721 [2024-11-09 19:36:20,149 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 19:36:20,150 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 239 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:20,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 60 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:36:20,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2024-11-09 19:36:20,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2024-11-09 19:36:20,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 720 states have (on average 1.9791666666666667) internal successors, (1425), 720 states have internal predecessors, (1425), 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 19:36:20,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1425 transitions. [2024-11-09 19:36:20,193 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1425 transitions. Word has length 123 [2024-11-09 19:36:20,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:20,194 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 1425 transitions. [2024-11-09 19:36:20,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 19:36:20,194 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1425 transitions. [2024-11-09 19:36:20,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 19:36:20,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:20,199 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:36:20,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:36:20,199 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:20,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:20,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1782585578, now seen corresponding path program 1 times [2024-11-09 19:36:20,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:20,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158972904] [2024-11-09 19:36:20,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:20,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:20,495 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:36:20,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:20,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158972904] [2024-11-09 19:36:20,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158972904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:20,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:36:20,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:36:20,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331778700] [2024-11-09 19:36:20,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:20,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:36:20,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:20,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:36:20,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:36:20,498 INFO L87 Difference]: Start difference. First operand 721 states and 1425 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:36:21,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:21,597 INFO L93 Difference]: Finished difference Result 1652 states and 3299 transitions. [2024-11-09 19:36:21,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:36:21,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2024-11-09 19:36:21,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:21,604 INFO L225 Difference]: With dead ends: 1652 [2024-11-09 19:36:21,604 INFO L226 Difference]: Without dead ends: 1082 [2024-11-09 19:36:21,605 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 19:36:21,606 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 217 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:21,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 125 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:36:21,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2024-11-09 19:36:21,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1079. [2024-11-09 19:36:21,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 1078 states have (on average 1.7755102040816326) internal successors, (1914), 1078 states have internal predecessors, (1914), 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 19:36:21,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1914 transitions. [2024-11-09 19:36:21,639 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1914 transitions. Word has length 137 [2024-11-09 19:36:21,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:21,639 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1914 transitions. [2024-11-09 19:36:21,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:36:21,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1914 transitions. [2024-11-09 19:36:21,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-09 19:36:21,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:21,645 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:36:21,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:36:21,646 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:21,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:21,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1548346544, now seen corresponding path program 1 times [2024-11-09 19:36:21,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:21,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107669396] [2024-11-09 19:36:21,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:21,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:22,084 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-09 19:36:22,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:22,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107669396] [2024-11-09 19:36:22,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107669396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:22,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:36:22,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:36:22,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907649291] [2024-11-09 19:36:22,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:22,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:36:22,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:22,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:36:22,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:36:22,087 INFO L87 Difference]: Start difference. First operand 1079 states and 1914 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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 19:36:22,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:22,828 INFO L93 Difference]: Finished difference Result 2514 states and 4559 transitions. [2024-11-09 19:36:22,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:36:22,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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 339 [2024-11-09 19:36:22,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:22,835 INFO L225 Difference]: With dead ends: 2514 [2024-11-09 19:36:22,836 INFO L226 Difference]: Without dead ends: 1616 [2024-11-09 19:36:22,837 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 19:36:22,838 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:22,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 81 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:36:22,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2024-11-09 19:36:22,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1437. [2024-11-09 19:36:22,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1436 states have (on average 1.7667130919220055) internal successors, (2537), 1436 states have internal predecessors, (2537), 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 19:36:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2537 transitions. [2024-11-09 19:36:22,867 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2537 transitions. Word has length 339 [2024-11-09 19:36:22,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:22,868 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 2537 transitions. [2024-11-09 19:36:22,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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 19:36:22,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2537 transitions. [2024-11-09 19:36:22,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-11-09 19:36:22,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:22,874 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:36:22,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:36:22,875 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:22,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:22,875 INFO L85 PathProgramCache]: Analyzing trace with hash 141205274, now seen corresponding path program 1 times [2024-11-09 19:36:22,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:22,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619826828] [2024-11-09 19:36:22,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:22,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2024-11-09 19:36:23,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:23,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619826828] [2024-11-09 19:36:23,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619826828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:23,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:36:23,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:36:23,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525011101] [2024-11-09 19:36:23,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:23,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:36:23,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:23,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:36:23,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:36:23,238 INFO L87 Difference]: Start difference. First operand 1437 states and 2537 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 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 19:36:24,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:24,141 INFO L93 Difference]: Finished difference Result 2902 states and 5139 transitions. [2024-11-09 19:36:24,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:36:24,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 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 350 [2024-11-09 19:36:24,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:24,148 INFO L225 Difference]: With dead ends: 2902 [2024-11-09 19:36:24,148 INFO L226 Difference]: Without dead ends: 1616 [2024-11-09 19:36:24,149 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 19:36:24,150 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 255 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:24,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 23 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:36:24,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2024-11-09 19:36:24,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1437. [2024-11-09 19:36:24,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1436 states have (on average 1.724233983286908) internal successors, (2476), 1436 states have internal predecessors, (2476), 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 19:36:24,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2476 transitions. [2024-11-09 19:36:24,179 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2476 transitions. Word has length 350 [2024-11-09 19:36:24,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:24,180 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 2476 transitions. [2024-11-09 19:36:24,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 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 19:36:24,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2476 transitions. [2024-11-09 19:36:24,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-11-09 19:36:24,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:24,185 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 19:36:24,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:36:24,186 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:24,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:24,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1811537416, now seen corresponding path program 1 times [2024-11-09 19:36:24,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:24,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143506481] [2024-11-09 19:36:24,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:24,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 327 proven. 23 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-09 19:36:24,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:24,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143506481] [2024-11-09 19:36:24,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143506481] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:36:24,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420189348] [2024-11-09 19:36:24,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:24,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:36:24,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:36:24,694 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 19:36:24,695 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 19:36:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:24,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:36:24,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:36:24,979 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-09 19:36:24,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:36:24,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420189348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:24,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:36:24,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:36:24,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135387655] [2024-11-09 19:36:24,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:24,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:36:24,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:24,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:36:24,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:36:24,984 INFO L87 Difference]: Start difference. First operand 1437 states and 2476 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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 19:36:25,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:25,748 INFO L93 Difference]: Finished difference Result 3409 states and 5934 transitions. [2024-11-09 19:36:25,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:36:25,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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 363 [2024-11-09 19:36:25,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:25,761 INFO L225 Difference]: With dead ends: 3409 [2024-11-09 19:36:25,761 INFO L226 Difference]: Without dead ends: 2153 [2024-11-09 19:36:25,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:36:25,763 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 240 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:25,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 365 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:36:25,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2024-11-09 19:36:25,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 1974. [2024-11-09 19:36:25,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1974 states, 1973 states have (on average 1.7192093258996453) internal successors, (3392), 1973 states have internal predecessors, (3392), 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 19:36:25,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 3392 transitions. [2024-11-09 19:36:25,799 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 3392 transitions. Word has length 363 [2024-11-09 19:36:25,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:25,799 INFO L471 AbstractCegarLoop]: Abstraction has 1974 states and 3392 transitions. [2024-11-09 19:36:25,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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 19:36:25,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 3392 transitions. [2024-11-09 19:36:25,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2024-11-09 19:36:25,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:25,807 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:36:25,825 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 19:36:26,010 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,SelfDestructingSolverStorable5 [2024-11-09 19:36:26,011 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:26,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:26,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2127407244, now seen corresponding path program 1 times [2024-11-09 19:36:26,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:26,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25069078] [2024-11-09 19:36:26,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:26,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:26,536 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 424 proven. 23 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-09 19:36:26,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:26,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25069078] [2024-11-09 19:36:26,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25069078] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:36:26,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62733074] [2024-11-09 19:36:26,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:26,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:36:26,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:36:26,539 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:36:26,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 19:36:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:26,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:36:26,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:36:26,803 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-11-09 19:36:26,803 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:36:26,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62733074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:26,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:36:26,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:36:26,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299701088] [2024-11-09 19:36:26,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:26,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:36:26,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:26,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:36:26,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:36:26,806 INFO L87 Difference]: Start difference. First operand 1974 states and 3392 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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 19:36:27,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:27,461 INFO L93 Difference]: Finished difference Result 4304 states and 7471 transitions. [2024-11-09 19:36:27,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:36:27,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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 455 [2024-11-09 19:36:27,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:27,473 INFO L225 Difference]: With dead ends: 4304 [2024-11-09 19:36:27,473 INFO L226 Difference]: Without dead ends: 2511 [2024-11-09 19:36:27,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:36:27,476 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 243 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:27,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 324 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:36:27,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2024-11-09 19:36:27,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 2153. [2024-11-09 19:36:27,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2153 states, 2152 states have (on average 1.7383828996282529) internal successors, (3741), 2152 states have internal predecessors, (3741), 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 19:36:27,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2153 states to 2153 states and 3741 transitions. [2024-11-09 19:36:27,531 INFO L78 Accepts]: Start accepts. Automaton has 2153 states and 3741 transitions. Word has length 455 [2024-11-09 19:36:27,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:27,532 INFO L471 AbstractCegarLoop]: Abstraction has 2153 states and 3741 transitions. [2024-11-09 19:36:27,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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 19:36:27,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2153 states and 3741 transitions. [2024-11-09 19:36:27,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2024-11-09 19:36:27,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:36:27,545 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:36:27,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 19:36:27,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 19:36:27,746 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:36:27,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:36:27,746 INFO L85 PathProgramCache]: Analyzing trace with hash 569430170, now seen corresponding path program 1 times [2024-11-09 19:36:27,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:36:27,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377516977] [2024-11-09 19:36:27,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:27,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:36:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:28,295 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 612 proven. 23 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-09 19:36:28,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:36:28,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377516977] [2024-11-09 19:36:28,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377516977] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:36:28,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446074765] [2024-11-09 19:36:28,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:36:28,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:36:28,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:36:28,299 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:36:28,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 19:36:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:36:28,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:36:28,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:36:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2024-11-09 19:36:28,543 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:36:28,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446074765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:36:28,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:36:28,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:36:28,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690830898] [2024-11-09 19:36:28,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:36:28,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:36:28,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:36:28,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:36:28,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:36:28,545 INFO L87 Difference]: Start difference. First operand 2153 states and 3741 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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 19:36:29,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:36:29,146 INFO L93 Difference]: Finished difference Result 5196 states and 9097 transitions. [2024-11-09 19:36:29,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:36:29,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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 516 [2024-11-09 19:36:29,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:36:29,148 INFO L225 Difference]: With dead ends: 5196 [2024-11-09 19:36:29,148 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 19:36:29,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:36:29,153 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 250 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:36:29,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 320 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:36:29,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 19:36:29,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 19:36:29,154 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 19:36:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 19:36:29,154 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 516 [2024-11-09 19:36:29,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:36:29,154 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 19:36:29,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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 19:36:29,155 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 19:36:29,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 19:36:29,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 19:36:29,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 19:36:29,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:36:29,362 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:36:29,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 19:36:29,543 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 19:36:29,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:36:29 BoogieIcfgContainer [2024-11-09 19:36:29,555 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 19:36:29,555 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 19:36:29,556 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 19:36:29,556 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 19:36:29,557 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:36:16" (3/4) ... [2024-11-09 19:36:29,560 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 19:36:29,585 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 19:36:29,586 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 19:36:29,588 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 19:36:29,589 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 19:36:29,774 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 19:36:29,777 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 19:36:29,777 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 19:36:29,778 INFO L158 Benchmark]: Toolchain (without parser) took 16011.28ms. Allocated memory was 159.4MB in the beginning and 371.2MB in the end (delta: 211.8MB). Free memory was 126.6MB in the beginning and 236.0MB in the end (delta: -109.3MB). Peak memory consumption was 102.6MB. Max. memory is 16.1GB. [2024-11-09 19:36:29,778 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory was 80.7MB in the beginning and 80.5MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 19:36:29,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.15ms. Allocated memory is still 159.4MB. Free memory was 126.6MB in the beginning and 90.1MB in the end (delta: 36.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-09 19:36:29,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.96ms. Allocated memory is still 159.4MB. Free memory was 90.1MB in the beginning and 80.6MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 19:36:29,778 INFO L158 Benchmark]: Boogie Preprocessor took 125.56ms. Allocated memory is still 159.4MB. Free memory was 80.6MB in the beginning and 68.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 19:36:29,779 INFO L158 Benchmark]: IcfgBuilder took 1648.16ms. Allocated memory is still 159.4MB. Free memory was 68.1MB in the beginning and 51.2MB in the end (delta: 16.8MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2024-11-09 19:36:29,779 INFO L158 Benchmark]: TraceAbstraction took 13293.17ms. Allocated memory was 159.4MB in the beginning and 371.2MB in the end (delta: 211.8MB). Free memory was 50.2MB in the beginning and 253.8MB in the end (delta: -203.6MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2024-11-09 19:36:29,779 INFO L158 Benchmark]: Witness Printer took 221.66ms. Allocated memory is still 371.2MB. Free memory was 253.8MB in the beginning and 236.0MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 19:36:29,783 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.17ms. Allocated memory is still 109.1MB. Free memory was 80.7MB in the beginning and 80.5MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 618.15ms. Allocated memory is still 159.4MB. Free memory was 126.6MB in the beginning and 90.1MB in the end (delta: 36.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.96ms. Allocated memory is still 159.4MB. Free memory was 90.1MB in the beginning and 80.6MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 125.56ms. Allocated memory is still 159.4MB. Free memory was 80.6MB in the beginning and 68.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * IcfgBuilder took 1648.16ms. Allocated memory is still 159.4MB. Free memory was 68.1MB in the beginning and 51.2MB in the end (delta: 16.8MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13293.17ms. Allocated memory was 159.4MB in the beginning and 371.2MB in the end (delta: 211.8MB). Free memory was 50.2MB in the beginning and 253.8MB in the end (delta: -203.6MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Witness Printer took 221.66ms. Allocated memory is still 371.2MB. Free memory was 253.8MB in the beginning and 236.0MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. 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: 176]: 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, 248 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.0s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2508 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2508 mSDsluCounter, 1497 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 841 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7176 IncrementalHoareTripleChecker+Invalid, 8017 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 841 mSolverCounterUnsat, 1417 mSDtfsCounter, 7176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1358 GetRequests, 1337 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2153occurred in iteration=7, InterpolantAutomatonStates: 27, 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, 8 MinimizatonAttempts, 898 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 3673 NumberOfCodeBlocks, 3673 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 3662 ConstructedInterpolants, 0 QuantifiedInterpolants, 14378 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1692 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 4341/4410 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: 890]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 19:36:29,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE