./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label02.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 c0f41b7d074691792fd10e7dba36f11652ac022c2313237070654cd8c5fa3312 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 20:17:33,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 20:17:33,909 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 20:17:33,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 20:17:33,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 20:17:33,955 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 20:17:33,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 20:17:33,956 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 20:17:33,956 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 20:17:33,957 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 20:17:33,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 20:17:33,957 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 20:17:33,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 20:17:33,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 20:17:33,959 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 20:17:33,959 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 20:17:33,960 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 20:17:33,960 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 20:17:33,960 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 20:17:33,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 20:17:33,961 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 20:17:33,966 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 20:17:33,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 20:17:33,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 20:17:33,966 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 20:17:33,967 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 20:17:33,967 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 20:17:33,967 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 20:17:33,968 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 20:17:33,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 20:17:33,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 20:17:33,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 20:17:33,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 20:17:33,969 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 20:17:33,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 20:17:33,970 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 20:17:33,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 20:17:33,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 20:17:33,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 20:17:33,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 20:17:33,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 20:17:33,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 20:17:33,972 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 -> c0f41b7d074691792fd10e7dba36f11652ac022c2313237070654cd8c5fa3312 [2024-10-23 20:17:34,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 20:17:34,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 20:17:34,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 20:17:34,258 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 20:17:34,258 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 20:17:34,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label02.c [2024-10-23 20:17:35,731 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 20:17:35,987 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 20:17:35,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label02.c [2024-10-23 20:17:36,006 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/816c3cc6e/2758210bd6e94a64ac0b90ff77050432/FLAG445aca493 [2024-10-23 20:17:36,298 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/816c3cc6e/2758210bd6e94a64ac0b90ff77050432 [2024-10-23 20:17:36,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 20:17:36,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 20:17:36,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 20:17:36,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 20:17:36,307 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 20:17:36,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:17:36" (1/1) ... [2024-10-23 20:17:36,310 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67681a33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:36, skipping insertion in model container [2024-10-23 20:17:36,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:17:36" (1/1) ... [2024-10-23 20:17:36,351 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 20:17:36,664 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label02.c[16747,16760] [2024-10-23 20:17:36,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 20:17:36,738 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 20:17:36,788 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label02.c[16747,16760] [2024-10-23 20:17:36,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 20:17:36,825 INFO L204 MainTranslator]: Completed translation [2024-10-23 20:17:36,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:36 WrapperNode [2024-10-23 20:17:36,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 20:17:36,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 20:17:36,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 20:17:36,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 20:17:36,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:36" (1/1) ... [2024-10-23 20:17:36,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:36" (1/1) ... [2024-10-23 20:17:36,937 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2024-10-23 20:17:36,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 20:17:36,939 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 20:17:36,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 20:17:36,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 20:17:36,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:36" (1/1) ... [2024-10-23 20:17:36,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:36" (1/1) ... [2024-10-23 20:17:36,958 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:36" (1/1) ... [2024-10-23 20:17:36,983 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-23 20:17:36,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:36" (1/1) ... [2024-10-23 20:17:36,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:36" (1/1) ... [2024-10-23 20:17:37,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:36" (1/1) ... [2024-10-23 20:17:37,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:36" (1/1) ... [2024-10-23 20:17:37,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:36" (1/1) ... [2024-10-23 20:17:37,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:36" (1/1) ... [2024-10-23 20:17:37,028 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 20:17:37,029 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 20:17:37,029 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 20:17:37,029 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 20:17:37,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:36" (1/1) ... [2024-10-23 20:17:37,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 20:17:37,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:17:37,069 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 20:17:37,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 20:17:37,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 20:17:37,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 20:17:37,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 20:17:37,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 20:17:37,205 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 20:17:37,207 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 20:17:38,200 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-10-23 20:17:38,201 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 20:17:38,263 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 20:17:38,264 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 20:17:38,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:17:38 BoogieIcfgContainer [2024-10-23 20:17:38,265 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 20:17:38,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 20:17:38,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 20:17:38,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 20:17:38,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:17:36" (1/3) ... [2024-10-23 20:17:38,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca21f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:17:38, skipping insertion in model container [2024-10-23 20:17:38,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:36" (2/3) ... [2024-10-23 20:17:38,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca21f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:17:38, skipping insertion in model container [2024-10-23 20:17:38,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:17:38" (3/3) ... [2024-10-23 20:17:38,274 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label02.c [2024-10-23 20:17:38,294 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 20:17:38,295 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 20:17:38,428 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 20:17:38,437 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;@3552b2dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 20:17:38,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 20:17:38,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:38,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-23 20:17:38,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:17:38,460 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:17:38,461 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:17:38,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:17:38,467 INFO L85 PathProgramCache]: Analyzing trace with hash -249031435, now seen corresponding path program 1 times [2024-10-23 20:17:38,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:17:38,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407616664] [2024-10-23 20:17:38,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:17:38,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:17:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:17:38,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:17:38,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:17:38,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407616664] [2024-10-23 20:17:38,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407616664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:17:38,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:17:38,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:17:38,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487510998] [2024-10-23 20:17:38,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:17:38,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 20:17:38,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:17:38,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 20:17:38,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 20:17:38,881 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:38,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:17:38,916 INFO L93 Difference]: Finished difference Result 271 states and 529 transitions. [2024-10-23 20:17:38,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 20:17:38,919 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 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 89 [2024-10-23 20:17:38,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:17:38,927 INFO L225 Difference]: With dead ends: 271 [2024-10-23 20:17:38,927 INFO L226 Difference]: Without dead ends: 134 [2024-10-23 20:17:38,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 20:17:38,933 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 20:17:38,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 20:17:38,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-23 20:17:38,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-23 20:17:38,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 133 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:38,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions. [2024-10-23 20:17:38,971 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 89 [2024-10-23 20:17:38,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:17:38,973 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 200 transitions. [2024-10-23 20:17:38,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:38,973 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions. [2024-10-23 20:17:38,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-23 20:17:38,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:17:38,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:17:38,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 20:17:38,976 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:17:38,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:17:38,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1330006505, now seen corresponding path program 1 times [2024-10-23 20:17:38,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:17:38,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270903219] [2024-10-23 20:17:38,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:17:38,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:17:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:17:39,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:17:39,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:17:39,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270903219] [2024-10-23 20:17:39,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270903219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:17:39,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:17:39,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:17:39,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253550356] [2024-10-23 20:17:39,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:17:39,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:17:39,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:17:39,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:17:39,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:17:39,241 INFO L87 Difference]: Start difference. First operand 134 states and 200 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:39,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:17:39,822 INFO L93 Difference]: Finished difference Result 398 states and 597 transitions. [2024-10-23 20:17:39,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:17:39,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 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 89 [2024-10-23 20:17:39,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:17:39,826 INFO L225 Difference]: With dead ends: 398 [2024-10-23 20:17:39,826 INFO L226 Difference]: Without dead ends: 265 [2024-10-23 20:17:39,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:17:39,830 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 55 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:17:39,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 23 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:17:39,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-23 20:17:39,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2024-10-23 20:17:39,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.4583333333333333) internal successors, (385), 264 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 385 transitions. [2024-10-23 20:17:39,860 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 385 transitions. Word has length 89 [2024-10-23 20:17:39,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:17:39,860 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 385 transitions. [2024-10-23 20:17:39,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:39,861 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 385 transitions. [2024-10-23 20:17:39,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-23 20:17:39,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:17:39,864 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:17:39,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 20:17:39,864 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:17:39,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:17:39,865 INFO L85 PathProgramCache]: Analyzing trace with hash 757025258, now seen corresponding path program 1 times [2024-10-23 20:17:39,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:17:39,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248393690] [2024-10-23 20:17:39,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:17:39,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:17:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:17:39,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:17:39,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:17:39,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248393690] [2024-10-23 20:17:39,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248393690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:17:39,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:17:39,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:17:39,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603351611] [2024-10-23 20:17:39,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:17:39,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:17:39,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:17:39,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:17:39,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:17:39,977 INFO L87 Difference]: Start difference. First operand 265 states and 385 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:40,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:17:40,393 INFO L93 Difference]: Finished difference Result 791 states and 1152 transitions. [2024-10-23 20:17:40,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:17:40,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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 95 [2024-10-23 20:17:40,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:17:40,397 INFO L225 Difference]: With dead ends: 791 [2024-10-23 20:17:40,397 INFO L226 Difference]: Without dead ends: 527 [2024-10-23 20:17:40,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:17:40,399 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:17:40,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 34 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:17:40,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-10-23 20:17:40,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2024-10-23 20:17:40,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.3802281368821292) internal successors, (726), 526 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 726 transitions. [2024-10-23 20:17:40,428 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 726 transitions. Word has length 95 [2024-10-23 20:17:40,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:17:40,428 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 726 transitions. [2024-10-23 20:17:40,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:40,429 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 726 transitions. [2024-10-23 20:17:40,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-23 20:17:40,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:17:40,433 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:17:40,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 20:17:40,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:17:40,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:17:40,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1711657258, now seen corresponding path program 1 times [2024-10-23 20:17:40,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:17:40,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61168474] [2024-10-23 20:17:40,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:17:40,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:17:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:17:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 20:17:40,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:17:40,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61168474] [2024-10-23 20:17:40,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61168474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:17:40,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:17:40,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:17:40,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236813797] [2024-10-23 20:17:40,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:17:40,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:17:40,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:17:40,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:17:40,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:17:40,615 INFO L87 Difference]: Start difference. First operand 527 states and 726 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:41,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:17:41,014 INFO L93 Difference]: Finished difference Result 1577 states and 2175 transitions. [2024-10-23 20:17:41,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:17:41,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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 96 [2024-10-23 20:17:41,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:17:41,018 INFO L225 Difference]: With dead ends: 1577 [2024-10-23 20:17:41,019 INFO L226 Difference]: Without dead ends: 1051 [2024-10-23 20:17:41,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:17:41,022 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 59 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:17:41,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 29 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:17:41,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-10-23 20:17:41,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 658. [2024-10-23 20:17:41,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 657 states have (on average 1.3774733637747336) internal successors, (905), 657 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:41,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 905 transitions. [2024-10-23 20:17:41,042 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 905 transitions. Word has length 96 [2024-10-23 20:17:41,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:17:41,043 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 905 transitions. [2024-10-23 20:17:41,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:41,043 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 905 transitions. [2024-10-23 20:17:41,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-23 20:17:41,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:17:41,046 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:17:41,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 20:17:41,047 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:17:41,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:17:41,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1161296357, now seen corresponding path program 1 times [2024-10-23 20:17:41,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:17:41,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043204621] [2024-10-23 20:17:41,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:17:41,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:17:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:17:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:17:41,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:17:41,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043204621] [2024-10-23 20:17:41,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043204621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:17:41,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:17:41,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:17:41,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549082217] [2024-10-23 20:17:41,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:17:41,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:17:41,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:17:41,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:17:41,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:17:41,258 INFO L87 Difference]: Start difference. First operand 658 states and 905 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:41,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:17:41,668 INFO L93 Difference]: Finished difference Result 1577 states and 2155 transitions. [2024-10-23 20:17:41,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:17:41,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 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 102 [2024-10-23 20:17:41,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:17:41,671 INFO L225 Difference]: With dead ends: 1577 [2024-10-23 20:17:41,672 INFO L226 Difference]: Without dead ends: 920 [2024-10-23 20:17:41,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:17:41,674 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 134 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:17:41,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 53 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:17:41,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-10-23 20:17:41,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920. [2024-10-23 20:17:41,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 919 states have (on average 1.309031556039173) internal successors, (1203), 919 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:41,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1203 transitions. [2024-10-23 20:17:41,692 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1203 transitions. Word has length 102 [2024-10-23 20:17:41,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:17:41,693 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1203 transitions. [2024-10-23 20:17:41,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:41,693 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1203 transitions. [2024-10-23 20:17:41,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-23 20:17:41,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:17:41,695 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:17:41,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 20:17:41,695 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:17:41,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:17:41,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1685867259, now seen corresponding path program 1 times [2024-10-23 20:17:41,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:17:41,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356088713] [2024-10-23 20:17:41,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:17:41,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:17:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:17:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-23 20:17:41,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:17:41,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356088713] [2024-10-23 20:17:41,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356088713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:17:41,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:17:41,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:17:41,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346944840] [2024-10-23 20:17:41,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:17:41,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:17:41,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:17:41,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:17:41,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:17:41,860 INFO L87 Difference]: Start difference. First operand 920 states and 1203 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:42,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:17:42,298 INFO L93 Difference]: Finished difference Result 2363 states and 3055 transitions. [2024-10-23 20:17:42,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:17:42,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-10-23 20:17:42,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:17:42,305 INFO L225 Difference]: With dead ends: 2363 [2024-10-23 20:17:42,306 INFO L226 Difference]: Without dead ends: 1444 [2024-10-23 20:17:42,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:17:42,310 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 136 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:17:42,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 45 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:17:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2024-10-23 20:17:42,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1182. [2024-10-23 20:17:42,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.2861981371718882) internal successors, (1519), 1181 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1519 transitions. [2024-10-23 20:17:42,342 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1519 transitions. Word has length 115 [2024-10-23 20:17:42,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:17:42,343 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1519 transitions. [2024-10-23 20:17:42,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1519 transitions. [2024-10-23 20:17:42,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-23 20:17:42,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:17:42,348 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:17:42,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 20:17:42,348 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:17:42,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:17:42,349 INFO L85 PathProgramCache]: Analyzing trace with hash -312951428, now seen corresponding path program 1 times [2024-10-23 20:17:42,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:17:42,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789350082] [2024-10-23 20:17:42,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:17:42,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:17:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:17:42,511 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-23 20:17:42,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:17:42,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789350082] [2024-10-23 20:17:42,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789350082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:17:42,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:17:42,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:17:42,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550136383] [2024-10-23 20:17:42,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:17:42,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:17:42,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:17:42,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:17:42,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:17:42,514 INFO L87 Difference]: Start difference. First operand 1182 states and 1519 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:42,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:17:42,922 INFO L93 Difference]: Finished difference Result 2494 states and 3204 transitions. [2024-10-23 20:17:42,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:17:42,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2024-10-23 20:17:42,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:17:42,927 INFO L225 Difference]: With dead ends: 2494 [2024-10-23 20:17:42,927 INFO L226 Difference]: Without dead ends: 1313 [2024-10-23 20:17:42,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:17:42,930 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 121 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:17:42,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 72 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:17:42,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2024-10-23 20:17:42,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1313. [2024-10-23 20:17:42,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1313 states, 1312 states have (on average 1.271341463414634) internal successors, (1668), 1312 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:42,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1668 transitions. [2024-10-23 20:17:42,957 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1668 transitions. Word has length 117 [2024-10-23 20:17:42,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:17:42,957 INFO L471 AbstractCegarLoop]: Abstraction has 1313 states and 1668 transitions. [2024-10-23 20:17:42,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:42,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1668 transitions. [2024-10-23 20:17:42,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-23 20:17:42,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:17:42,960 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:17:42,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-23 20:17:42,960 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:17:42,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:17:42,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1702196812, now seen corresponding path program 1 times [2024-10-23 20:17:42,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:17:42,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941183775] [2024-10-23 20:17:42,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:17:42,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:17:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:17:43,147 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-23 20:17:43,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:17:43,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941183775] [2024-10-23 20:17:43,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941183775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:17:43,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:17:43,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:17:43,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339256675] [2024-10-23 20:17:43,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:17:43,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 20:17:43,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:17:43,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 20:17:43,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 20:17:43,151 INFO L87 Difference]: Start difference. First operand 1313 states and 1668 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:43,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:17:43,770 INFO L93 Difference]: Finished difference Result 3018 states and 3776 transitions. [2024-10-23 20:17:43,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 20:17:43,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 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 121 [2024-10-23 20:17:43,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:17:43,777 INFO L225 Difference]: With dead ends: 3018 [2024-10-23 20:17:43,777 INFO L226 Difference]: Without dead ends: 1706 [2024-10-23 20:17:43,779 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-10-23 20:17:43,782 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 377 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:17:43,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 69 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:17:43,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2024-10-23 20:17:43,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1575. [2024-10-23 20:17:43,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1574 states have (on average 1.241423125794155) internal successors, (1954), 1574 states have internal predecessors, (1954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:43,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 1954 transitions. [2024-10-23 20:17:43,830 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 1954 transitions. Word has length 121 [2024-10-23 20:17:43,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:17:43,830 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 1954 transitions. [2024-10-23 20:17:43,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:43,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1954 transitions. [2024-10-23 20:17:43,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-23 20:17:43,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:17:43,833 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:17:43,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-23 20:17:43,834 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:17:43,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:17:43,834 INFO L85 PathProgramCache]: Analyzing trace with hash -808632493, now seen corresponding path program 1 times [2024-10-23 20:17:43,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:17:43,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966302825] [2024-10-23 20:17:43,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:17:43,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:17:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:17:44,109 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:17:44,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:17:44,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966302825] [2024-10-23 20:17:44,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966302825] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:17:44,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624053613] [2024-10-23 20:17:44,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:17:44,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:17:44,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:17:44,112 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 20:17:44,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-23 20:17:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:17:44,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:17:44,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:17:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-23 20:17:44,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:17:44,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624053613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:17:44,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:17:44,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-23 20:17:44,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325594943] [2024-10-23 20:17:44,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:17:44,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:17:44,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:17:44,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:17:44,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:17:44,400 INFO L87 Difference]: Start difference. First operand 1575 states and 1954 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:44,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:17:44,812 INFO L93 Difference]: Finished difference Result 3673 states and 4577 transitions. [2024-10-23 20:17:44,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:17:44,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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 139 [2024-10-23 20:17:44,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:17:44,821 INFO L225 Difference]: With dead ends: 3673 [2024-10-23 20:17:44,821 INFO L226 Difference]: Without dead ends: 2099 [2024-10-23 20:17:44,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:17:44,825 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 65 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:17:44,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 29 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:17:44,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2024-10-23 20:17:44,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1968. [2024-10-23 20:17:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1968 states, 1967 states have (on average 1.2175902389425521) internal successors, (2395), 1967 states have internal predecessors, (2395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:44,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 2395 transitions. [2024-10-23 20:17:44,859 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 2395 transitions. Word has length 139 [2024-10-23 20:17:44,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:17:44,859 INFO L471 AbstractCegarLoop]: Abstraction has 1968 states and 2395 transitions. [2024-10-23 20:17:44,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:44,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2395 transitions. [2024-10-23 20:17:44,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-23 20:17:44,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:17:44,863 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:17:44,883 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-10-23 20:17:45,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:17:45,064 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:17:45,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:17:45,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1895552292, now seen corresponding path program 1 times [2024-10-23 20:17:45,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:17:45,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776691416] [2024-10-23 20:17:45,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:17:45,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:17:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:17:45,363 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 82 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-23 20:17:45,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:17:45,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776691416] [2024-10-23 20:17:45,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776691416] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:17:45,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203036969] [2024-10-23 20:17:45,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:17:45,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:17:45,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:17:45,365 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 20:17:45,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-23 20:17:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:17:45,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:17:45,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:17:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-23 20:17:45,627 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:17:45,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203036969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:17:45,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:17:45,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-23 20:17:45,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217650853] [2024-10-23 20:17:45,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:17:45,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:17:45,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:17:45,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:17:45,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:17:45,629 INFO L87 Difference]: Start difference. First operand 1968 states and 2395 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:46,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:17:46,054 INFO L93 Difference]: Finished difference Result 4459 states and 5458 transitions. [2024-10-23 20:17:46,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:17:46,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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 162 [2024-10-23 20:17:46,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:17:46,087 INFO L225 Difference]: With dead ends: 4459 [2024-10-23 20:17:46,087 INFO L226 Difference]: Without dead ends: 2492 [2024-10-23 20:17:46,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:17:46,090 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 49 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:17:46,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 190 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:17:46,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2024-10-23 20:17:46,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2230. [2024-10-23 20:17:46,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2230 states, 2229 states have (on average 1.2081650964558097) internal successors, (2693), 2229 states have internal predecessors, (2693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:46,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 2693 transitions. [2024-10-23 20:17:46,141 INFO L78 Accepts]: Start accepts. Automaton has 2230 states and 2693 transitions. Word has length 162 [2024-10-23 20:17:46,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:17:46,141 INFO L471 AbstractCegarLoop]: Abstraction has 2230 states and 2693 transitions. [2024-10-23 20:17:46,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:46,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 2693 transitions. [2024-10-23 20:17:46,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-23 20:17:46,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:17:46,146 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:17:46,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-23 20:17:46,347 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,SelfDestructingSolverStorable9 [2024-10-23 20:17:46,347 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:17:46,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:17:46,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1333069049, now seen corresponding path program 1 times [2024-10-23 20:17:46,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:17:46,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256394185] [2024-10-23 20:17:46,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:17:46,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:17:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:17:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:17:46,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:17:46,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256394185] [2024-10-23 20:17:46,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256394185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:17:46,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:17:46,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:17:46,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275940491] [2024-10-23 20:17:46,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:17:46,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 20:17:46,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:17:46,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 20:17:46,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 20:17:46,575 INFO L87 Difference]: Start difference. First operand 2230 states and 2693 transitions. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:47,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:17:47,246 INFO L93 Difference]: Finished difference Result 4983 states and 5981 transitions. [2024-10-23 20:17:47,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 20:17:47,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 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 175 [2024-10-23 20:17:47,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:17:47,256 INFO L225 Difference]: With dead ends: 4983 [2024-10-23 20:17:47,256 INFO L226 Difference]: Without dead ends: 2754 [2024-10-23 20:17:47,259 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-10-23 20:17:47,259 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 193 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:17:47,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 49 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:17:47,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2754 states. [2024-10-23 20:17:47,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 2492. [2024-10-23 20:17:47,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2492 states, 2491 states have (on average 1.191087916499398) internal successors, (2967), 2491 states have internal predecessors, (2967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:47,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 2967 transitions. [2024-10-23 20:17:47,302 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 2967 transitions. Word has length 175 [2024-10-23 20:17:47,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:17:47,302 INFO L471 AbstractCegarLoop]: Abstraction has 2492 states and 2967 transitions. [2024-10-23 20:17:47,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:47,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 2967 transitions. [2024-10-23 20:17:47,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-23 20:17:47,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:17:47,307 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:17:47,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-23 20:17:47,307 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:17:47,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:17:47,307 INFO L85 PathProgramCache]: Analyzing trace with hash -2008746886, now seen corresponding path program 1 times [2024-10-23 20:17:47,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:17:47,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603328300] [2024-10-23 20:17:47,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:17:47,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:17:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:17:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 101 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:17:47,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:17:47,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603328300] [2024-10-23 20:17:47,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603328300] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:17:47,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944370251] [2024-10-23 20:17:47,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:17:47,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:17:47,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:17:47,813 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 20:17:47,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-23 20:17:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:17:47,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:17:47,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:17:48,040 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-23 20:17:48,040 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:17:48,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944370251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:17:48,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:17:48,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-23 20:17:48,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470574534] [2024-10-23 20:17:48,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:17:48,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:17:48,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:17:48,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:17:48,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-23 20:17:48,042 INFO L87 Difference]: Start difference. First operand 2492 states and 2967 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:48,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:17:48,473 INFO L93 Difference]: Finished difference Result 6555 states and 7825 transitions. [2024-10-23 20:17:48,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:17:48,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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 188 [2024-10-23 20:17:48,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:17:48,488 INFO L225 Difference]: With dead ends: 6555 [2024-10-23 20:17:48,489 INFO L226 Difference]: Without dead ends: 4064 [2024-10-23 20:17:48,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-23 20:17:48,493 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 66 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:17:48,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 29 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:17:48,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4064 states. [2024-10-23 20:17:48,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4064 to 3802. [2024-10-23 20:17:48,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3802 states, 3801 states have (on average 1.1820573533280716) internal successors, (4493), 3801 states have internal predecessors, (4493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:48,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3802 states to 3802 states and 4493 transitions. [2024-10-23 20:17:48,563 INFO L78 Accepts]: Start accepts. Automaton has 3802 states and 4493 transitions. Word has length 188 [2024-10-23 20:17:48,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:17:48,563 INFO L471 AbstractCegarLoop]: Abstraction has 3802 states and 4493 transitions. [2024-10-23 20:17:48,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:48,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3802 states and 4493 transitions. [2024-10-23 20:17:48,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-23 20:17:48,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:17:48,572 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:17:48,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-23 20:17:48,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:17:48,772 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:17:48,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:17:48,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1224180588, now seen corresponding path program 1 times [2024-10-23 20:17:48,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:17:48,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903147844] [2024-10-23 20:17:48,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:17:48,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:17:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:17:48,893 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-10-23 20:17:48,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:17:48,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903147844] [2024-10-23 20:17:48,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903147844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:17:48,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:17:48,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:17:48,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990244480] [2024-10-23 20:17:48,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:17:48,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:17:48,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:17:48,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:17:48,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:17:48,897 INFO L87 Difference]: Start difference. First operand 3802 states and 4493 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:49,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:17:49,337 INFO L93 Difference]: Finished difference Result 7996 states and 9450 transitions. [2024-10-23 20:17:49,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:17:49,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 200 [2024-10-23 20:17:49,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:17:49,349 INFO L225 Difference]: With dead ends: 7996 [2024-10-23 20:17:49,349 INFO L226 Difference]: Without dead ends: 3933 [2024-10-23 20:17:49,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:17:49,355 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 137 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:17:49,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 188 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:17:49,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3933 states. [2024-10-23 20:17:49,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3933 to 3671. [2024-10-23 20:17:49,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3671 states, 3670 states have (on average 1.1079019073569483) internal successors, (4066), 3670 states have internal predecessors, (4066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 4066 transitions. [2024-10-23 20:17:49,444 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 4066 transitions. Word has length 200 [2024-10-23 20:17:49,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:17:49,445 INFO L471 AbstractCegarLoop]: Abstraction has 3671 states and 4066 transitions. [2024-10-23 20:17:49,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:49,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 4066 transitions. [2024-10-23 20:17:49,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-23 20:17:49,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:17:49,456 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:17:49,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-23 20:17:49,456 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:17:49,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:17:49,457 INFO L85 PathProgramCache]: Analyzing trace with hash -746525234, now seen corresponding path program 1 times [2024-10-23 20:17:49,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:17:49,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836715614] [2024-10-23 20:17:49,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:17:49,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:17:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:17:49,779 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 161 proven. 6 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-10-23 20:17:49,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:17:49,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836715614] [2024-10-23 20:17:49,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836715614] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:17:49,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044919362] [2024-10-23 20:17:49,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:17:49,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:17:49,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:17:49,783 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 20:17:49,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-23 20:17:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:17:49,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:17:49,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:17:50,074 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-10-23 20:17:50,075 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:17:50,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044919362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:17:50,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:17:50,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-23 20:17:50,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319979278] [2024-10-23 20:17:50,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:17:50,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:17:50,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:17:50,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:17:50,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-23 20:17:50,076 INFO L87 Difference]: Start difference. First operand 3671 states and 4066 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:50,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:17:50,451 INFO L93 Difference]: Finished difference Result 7734 states and 8574 transitions. [2024-10-23 20:17:50,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:17:50,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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 220 [2024-10-23 20:17:50,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:17:50,466 INFO L225 Difference]: With dead ends: 7734 [2024-10-23 20:17:50,466 INFO L226 Difference]: Without dead ends: 4064 [2024-10-23 20:17:50,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-23 20:17:50,471 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 55 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 20:17:50,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 166 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 20:17:50,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4064 states. [2024-10-23 20:17:50,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4064 to 3802. [2024-10-23 20:17:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3802 states, 3801 states have (on average 1.0941857405945803) internal successors, (4159), 3801 states have internal predecessors, (4159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:50,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3802 states to 3802 states and 4159 transitions. [2024-10-23 20:17:50,546 INFO L78 Accepts]: Start accepts. Automaton has 3802 states and 4159 transitions. Word has length 220 [2024-10-23 20:17:50,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:17:50,546 INFO L471 AbstractCegarLoop]: Abstraction has 3802 states and 4159 transitions. [2024-10-23 20:17:50,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:50,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3802 states and 4159 transitions. [2024-10-23 20:17:50,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-10-23 20:17:50,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:17:50,554 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:17:50,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-23 20:17:50,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:17:50,755 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:17:50,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:17:50,755 INFO L85 PathProgramCache]: Analyzing trace with hash -2007466233, now seen corresponding path program 1 times [2024-10-23 20:17:50,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:17:50,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188754981] [2024-10-23 20:17:50,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:17:50,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:17:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:17:51,113 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 228 proven. 6 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-10-23 20:17:51,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:17:51,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188754981] [2024-10-23 20:17:51,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188754981] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:17:51,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981919030] [2024-10-23 20:17:51,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:17:51,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:17:51,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:17:51,116 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 20:17:51,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-23 20:17:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:17:51,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:17:51,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:17:51,330 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2024-10-23 20:17:51,330 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:17:51,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981919030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:17:51,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:17:51,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-23 20:17:51,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580133798] [2024-10-23 20:17:51,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:17:51,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:17:51,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:17:51,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:17:51,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-23 20:17:51,332 INFO L87 Difference]: Start difference. First operand 3802 states and 4159 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:51,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:17:51,713 INFO L93 Difference]: Finished difference Result 7601 states and 8296 transitions. [2024-10-23 20:17:51,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:17:51,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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 259 [2024-10-23 20:17:51,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:17:51,714 INFO L225 Difference]: With dead ends: 7601 [2024-10-23 20:17:51,714 INFO L226 Difference]: Without dead ends: 0 [2024-10-23 20:17:51,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-23 20:17:51,720 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 107 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 20:17:51,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 172 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 20:17:51,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-23 20:17:51,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-23 20:17:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-23 20:17:51,721 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 259 [2024-10-23 20:17:51,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:17:51,722 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-23 20:17:51,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:17:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-23 20:17:51,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-23 20:17:51,725 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 20:17:51,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-23 20:17:51,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-23 20:17:51,933 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:17:51,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-23 20:17:52,361 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 20:17:52,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:17:52 BoogieIcfgContainer [2024-10-23 20:17:52,379 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 20:17:52,379 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 20:17:52,379 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 20:17:52,380 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 20:17:52,380 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:17:38" (3/4) ... [2024-10-23 20:17:52,382 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-23 20:17:52,405 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-23 20:17:52,406 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-23 20:17:52,407 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-23 20:17:52,408 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-23 20:17:52,567 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 20:17:52,570 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-23 20:17:52,570 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 20:17:52,571 INFO L158 Benchmark]: Toolchain (without parser) took 16269.81ms. Allocated memory was 144.7MB in the beginning and 333.4MB in the end (delta: 188.7MB). Free memory was 88.0MB in the beginning and 113.6MB in the end (delta: -25.6MB). Peak memory consumption was 166.1MB. Max. memory is 16.1GB. [2024-10-23 20:17:52,571 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 144.7MB. Free memory was 105.7MB in the beginning and 105.6MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 20:17:52,571 INFO L158 Benchmark]: CACSL2BoogieTranslator took 523.70ms. Allocated memory is still 144.7MB. Free memory was 87.5MB in the beginning and 57.7MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-23 20:17:52,572 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.19ms. Allocated memory was 144.7MB in the beginning and 184.5MB in the end (delta: 39.8MB). Free memory was 57.7MB in the beginning and 152.3MB in the end (delta: -94.7MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-10-23 20:17:52,572 INFO L158 Benchmark]: Boogie Preprocessor took 89.56ms. Allocated memory is still 184.5MB. Free memory was 152.3MB in the beginning and 147.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-23 20:17:52,572 INFO L158 Benchmark]: RCFGBuilder took 1236.57ms. Allocated memory is still 184.5MB. Free memory was 147.1MB in the beginning and 53.8MB in the end (delta: 93.3MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. [2024-10-23 20:17:52,573 INFO L158 Benchmark]: TraceAbstraction took 14112.01ms. Allocated memory was 184.5MB in the beginning and 333.4MB in the end (delta: 148.9MB). Free memory was 52.7MB in the beginning and 126.2MB in the end (delta: -73.5MB). Peak memory consumption was 76.5MB. Max. memory is 16.1GB. [2024-10-23 20:17:52,573 INFO L158 Benchmark]: Witness Printer took 191.03ms. Allocated memory is still 333.4MB. Free memory was 125.2MB in the beginning and 113.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-23 20:17:52,575 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 144.7MB. Free memory was 105.7MB in the beginning and 105.6MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 523.70ms. Allocated memory is still 144.7MB. Free memory was 87.5MB in the beginning and 57.7MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.19ms. Allocated memory was 144.7MB in the beginning and 184.5MB in the end (delta: 39.8MB). Free memory was 57.7MB in the beginning and 152.3MB in the end (delta: -94.7MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.56ms. Allocated memory is still 184.5MB. Free memory was 152.3MB in the beginning and 147.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1236.57ms. Allocated memory is still 184.5MB. Free memory was 147.1MB in the beginning and 53.8MB in the end (delta: 93.3MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14112.01ms. Allocated memory was 184.5MB in the beginning and 333.4MB in the end (delta: 148.9MB). Free memory was 52.7MB in the beginning and 126.2MB in the end (delta: -73.5MB). Peak memory consumption was 76.5MB. Max. memory is 16.1GB. * Witness Printer took 191.03ms. Allocated memory is still 333.4MB. Free memory was 125.2MB in the beginning and 113.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 456]: 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, 136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.6s, OverallIterations: 15, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1696 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1696 mSDsluCounter, 1348 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 720 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5143 IncrementalHoareTripleChecker+Invalid, 5863 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 720 mSolverCounterUnsat, 1274 mSDtfsCounter, 5143 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1006 GetRequests, 976 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3802occurred in iteration=12, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 2227 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 3135 NumberOfCodeBlocks, 3135 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 3115 ConstructedInterpolants, 0 QuantifiedInterpolants, 7631 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1880 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 20 InterpolantComputations, 15 PerfectInterpolantSequences, 2415/2498 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: (((((((((((a21 == 1) && (a17 == 1)) && (a20 == 1)) || (((a8 <= 13) && (((a21 <= 0) && (a20 == 1)) || ((a21 <= 0) && (a17 == 1)))) && (a16 <= 4))) || ((a20 <= 0) && (a16 <= 4))) || (((a21 <= 0) && (a17 == 1)) && (a20 == 1))) || (((a7 <= 0) && (a8 <= 13)) && (a16 <= 4))) || ((a20 <= 0) && (14 <= a8))) || (((a17 == 1) && (a16 <= 4)) && (a20 == 1))) || ((6 <= a16) && (a20 == 1))) || ((14 <= a8) && (a20 == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-23 20:17:52,605 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