./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/Problem12_label29.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label29.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b97ff5ceba251ab7fbafe0c3432eac346423cbbff0a928a797ba0e4f7876661 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:23:04,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:23:04,298 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:23:04,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:23:04,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:23:04,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:23:04,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:23:04,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:23:04,339 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:23:04,340 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:23:04,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:23:04,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:23:04,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:23:04,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:23:04,344 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:23:04,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:23:04,344 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:23:04,344 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:23:04,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:23:04,345 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:23:04,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:23:04,349 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:23:04,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:23:04,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:23:04,350 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:23:04,350 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:23:04,350 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:23:04,350 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:23:04,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:23:04,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:23:04,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:23:04,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:23:04,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:23:04,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:23:04,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:23:04,352 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:23:04,352 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:23:04,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:23:04,353 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:23:04,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:23:04,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:23:04,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:23:04,355 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b97ff5ceba251ab7fbafe0c3432eac346423cbbff0a928a797ba0e4f7876661 [2024-10-10 23:23:04,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:23:04,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:23:04,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:23:04,630 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:23:04,634 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:23:04,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label29.c [2024-10-10 23:23:06,110 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:23:06,525 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:23:06,527 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label29.c [2024-10-10 23:23:06,562 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4545108e9/857856b39f774ff9bc184ededd1cf97b/FLAG6e8082e95 [2024-10-10 23:23:06,698 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4545108e9/857856b39f774ff9bc184ededd1cf97b [2024-10-10 23:23:06,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:23:06,705 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:23:06,706 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:23:06,706 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:23:06,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:23:06,711 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:23:06" (1/1) ... [2024-10-10 23:23:06,712 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4034d1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:06, skipping insertion in model container [2024-10-10 23:23:06,712 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:23:06" (1/1) ... [2024-10-10 23:23:06,825 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:23:07,125 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/Problem12_label29.c[6855,6868] [2024-10-10 23:23:07,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:23:07,870 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:23:07,899 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/Problem12_label29.c[6855,6868] [2024-10-10 23:23:08,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:23:08,315 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:23:08,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:08 WrapperNode [2024-10-10 23:23:08,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:23:08,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:23:08,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:23:08,317 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:23:08,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:08" (1/1) ... [2024-10-10 23:23:08,368 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:08" (1/1) ... [2024-10-10 23:23:08,684 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-10-10 23:23:08,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:23:08,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:23:08,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:23:08,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:23:08,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:08" (1/1) ... [2024-10-10 23:23:08,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:08" (1/1) ... [2024-10-10 23:23:08,753 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:08" (1/1) ... [2024-10-10 23:23:08,952 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:23:08,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:08" (1/1) ... [2024-10-10 23:23:08,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:08" (1/1) ... [2024-10-10 23:23:09,092 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:08" (1/1) ... [2024-10-10 23:23:09,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:08" (1/1) ... [2024-10-10 23:23:09,202 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:08" (1/1) ... [2024-10-10 23:23:09,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:08" (1/1) ... [2024-10-10 23:23:09,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:23:09,274 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:23:09,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:23:09,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:23:09,276 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:08" (1/1) ... [2024-10-10 23:23:09,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:23:09,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:23:09,316 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:23:09,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:23:09,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:23:09,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:23:09,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:23:09,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:23:09,440 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:23:09,442 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:23:13,869 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-10-10 23:23:13,869 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:23:13,940 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:23:13,940 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:23:13,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:23:13 BoogieIcfgContainer [2024-10-10 23:23:13,941 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:23:13,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:23:13,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:23:13,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:23:13,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:23:06" (1/3) ... [2024-10-10 23:23:13,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c3e5df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:23:13, skipping insertion in model container [2024-10-10 23:23:13,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:08" (2/3) ... [2024-10-10 23:23:13,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c3e5df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:23:13, skipping insertion in model container [2024-10-10 23:23:13,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:23:13" (3/3) ... [2024-10-10 23:23:13,948 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label29.c [2024-10-10 23:23:13,967 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:23:13,967 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:23:14,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:23:14,062 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;@524020ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:23:14,062 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:23:14,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:14,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-10 23:23:14,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:14,076 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] [2024-10-10 23:23:14,077 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:14,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:14,083 INFO L85 PathProgramCache]: Analyzing trace with hash -590736746, now seen corresponding path program 1 times [2024-10-10 23:23:14,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:14,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565736533] [2024-10-10 23:23:14,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:14,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:14,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:23:14,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:14,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565736533] [2024-10-10 23:23:14,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565736533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:14,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:14,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:23:14,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313702815] [2024-10-10 23:23:14,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:14,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:23:14,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:14,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:23:14,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:23:14,351 INFO L87 Difference]: Start difference. First operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 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 27.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:14,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:14,447 INFO L93 Difference]: Finished difference Result 1511 states and 3005 transitions. [2024-10-10 23:23:14,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:23:14,450 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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 54 [2024-10-10 23:23:14,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:14,476 INFO L225 Difference]: With dead ends: 1511 [2024-10-10 23:23:14,476 INFO L226 Difference]: Without dead ends: 754 [2024-10-10 23:23:14,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:23:14,489 INFO L432 NwaCegarLoop]: 1438 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, 1438 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:14,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:23:14,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-10 23:23:14,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-10-10 23:23:14,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2024-10-10 23:23:14,584 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 54 [2024-10-10 23:23:14,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:14,585 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2024-10-10 23:23:14,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:14,586 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2024-10-10 23:23:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-10 23:23:14,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:14,587 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] [2024-10-10 23:23:14,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:23:14,588 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:14,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:14,589 INFO L85 PathProgramCache]: Analyzing trace with hash -213528142, now seen corresponding path program 1 times [2024-10-10 23:23:14,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:14,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58949322] [2024-10-10 23:23:14,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:14,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:14,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:23:14,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:14,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58949322] [2024-10-10 23:23:14,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58949322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:14,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:14,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:23:14,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634819551] [2024-10-10 23:23:14,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:14,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:14,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:14,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:14,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:14,873 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:18,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:18,532 INFO L93 Difference]: Finished difference Result 2258 states and 4311 transitions. [2024-10-10 23:23:18,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:18,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 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 54 [2024-10-10 23:23:18,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:18,540 INFO L225 Difference]: With dead ends: 2258 [2024-10-10 23:23:18,540 INFO L226 Difference]: Without dead ends: 1505 [2024-10-10 23:23:18,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:18,543 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 746 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2262 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:18,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 473 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2262 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-10 23:23:18,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2024-10-10 23:23:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2024-10-10 23:23:18,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.6070478723404256) internal successors, (2417), 1504 states have internal predecessors, (2417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:18,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2417 transitions. [2024-10-10 23:23:18,592 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2417 transitions. Word has length 54 [2024-10-10 23:23:18,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:18,592 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2417 transitions. [2024-10-10 23:23:18,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:18,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2417 transitions. [2024-10-10 23:23:18,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-10 23:23:18,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:18,597 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:23:18,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:23:18,597 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:18,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:18,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1367380244, now seen corresponding path program 1 times [2024-10-10 23:23:18,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:18,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446440962] [2024-10-10 23:23:18,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:18,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:23:18,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:18,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446440962] [2024-10-10 23:23:18,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446440962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:18,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:18,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:23:18,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576714835] [2024-10-10 23:23:18,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:18,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:18,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:18,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:18,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:18,823 INFO L87 Difference]: Start difference. First operand 1505 states and 2417 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 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-10 23:23:21,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:21,931 INFO L93 Difference]: Finished difference Result 4511 states and 7248 transitions. [2024-10-10 23:23:21,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:21,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 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 129 [2024-10-10 23:23:21,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:21,943 INFO L225 Difference]: With dead ends: 4511 [2024-10-10 23:23:21,943 INFO L226 Difference]: Without dead ends: 3007 [2024-10-10 23:23:21,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:21,949 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 774 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 2931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:21,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 447 Invalid, 2931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1996 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-10 23:23:21,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2024-10-10 23:23:21,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 3007. [2024-10-10 23:23:22,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 3006 states have (on average 1.4158349966733201) internal successors, (4256), 3006 states have internal predecessors, (4256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4256 transitions. [2024-10-10 23:23:22,013 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4256 transitions. Word has length 129 [2024-10-10 23:23:22,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:22,015 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 4256 transitions. [2024-10-10 23:23:22,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 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-10 23:23:22,016 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4256 transitions. [2024-10-10 23:23:22,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-10 23:23:22,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:22,023 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:23:22,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:23:22,024 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:22,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:22,025 INFO L85 PathProgramCache]: Analyzing trace with hash -661137903, now seen corresponding path program 1 times [2024-10-10 23:23:22,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:22,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270190299] [2024-10-10 23:23:22,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:22,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:22,383 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:23:22,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:22,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270190299] [2024-10-10 23:23:22,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270190299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:22,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:22,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:22,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571737204] [2024-10-10 23:23:22,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:22,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:23:22,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:22,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:23:22,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:23:22,390 INFO L87 Difference]: Start difference. First operand 3007 states and 4256 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:26,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:26,693 INFO L93 Difference]: Finished difference Result 9768 states and 13600 transitions. [2024-10-10 23:23:26,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:23:26,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2024-10-10 23:23:26,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:26,722 INFO L225 Difference]: With dead ends: 9768 [2024-10-10 23:23:26,722 INFO L226 Difference]: Without dead ends: 6762 [2024-10-10 23:23:26,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:23:26,728 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 2179 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 4713 mSolverCounterSat, 747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2179 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 5460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 747 IncrementalHoareTripleChecker+Valid, 4713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:26,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2179 Valid, 164 Invalid, 5460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [747 Valid, 4713 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-10 23:23:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6762 states. [2024-10-10 23:23:26,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6762 to 6762. [2024-10-10 23:23:26,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6762 states, 6761 states have (on average 1.350835675195977) internal successors, (9133), 6761 states have internal predecessors, (9133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6762 states to 6762 states and 9133 transitions. [2024-10-10 23:23:26,843 INFO L78 Accepts]: Start accepts. Automaton has 6762 states and 9133 transitions. Word has length 131 [2024-10-10 23:23:26,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:26,843 INFO L471 AbstractCegarLoop]: Abstraction has 6762 states and 9133 transitions. [2024-10-10 23:23:26,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:26,844 INFO L276 IsEmpty]: Start isEmpty. Operand 6762 states and 9133 transitions. [2024-10-10 23:23:26,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-10 23:23:26,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:26,847 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:23:26,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:23:26,847 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:26,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:26,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1252744443, now seen corresponding path program 1 times [2024-10-10 23:23:26,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:26,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332827628] [2024-10-10 23:23:26,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:26,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:27,272 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 23:23:27,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:27,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332827628] [2024-10-10 23:23:27,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332827628] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:23:27,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408430304] [2024-10-10 23:23:27,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:27,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:23:27,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:23:27,278 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:23:27,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:23:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:27,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:23:27,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:23:27,672 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-10 23:23:27,672 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:23:27,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408430304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:27,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:23:27,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 23:23:27,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311471729] [2024-10-10 23:23:27,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:27,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:27,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:27,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:27,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:23:27,675 INFO L87 Difference]: Start difference. First operand 6762 states and 9133 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:30,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:30,136 INFO L93 Difference]: Finished difference Result 15776 states and 21143 transitions. [2024-10-10 23:23:30,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:30,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2024-10-10 23:23:30,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:30,171 INFO L225 Difference]: With dead ends: 15776 [2024-10-10 23:23:30,171 INFO L226 Difference]: Without dead ends: 9766 [2024-10-10 23:23:30,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:23:30,182 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 712 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 2852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:30,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 154 Invalid, 2852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 2396 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:23:30,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9766 states. [2024-10-10 23:23:30,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9766 to 9766. [2024-10-10 23:23:30,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9766 states, 9765 states have (on average 1.2557091653865848) internal successors, (12262), 9765 states have internal predecessors, (12262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:30,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9766 states to 9766 states and 12262 transitions. [2024-10-10 23:23:30,368 INFO L78 Accepts]: Start accepts. Automaton has 9766 states and 12262 transitions. Word has length 199 [2024-10-10 23:23:30,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:30,369 INFO L471 AbstractCegarLoop]: Abstraction has 9766 states and 12262 transitions. [2024-10-10 23:23:30,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:30,369 INFO L276 IsEmpty]: Start isEmpty. Operand 9766 states and 12262 transitions. [2024-10-10 23:23:30,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-10-10 23:23:30,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:30,374 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:23:30,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:23:30,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:23:30,576 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:30,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:30,578 INFO L85 PathProgramCache]: Analyzing trace with hash 944977603, now seen corresponding path program 1 times [2024-10-10 23:23:30,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:30,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156072754] [2024-10-10 23:23:30,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:30,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:30,955 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-10 23:23:30,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:30,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156072754] [2024-10-10 23:23:30,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156072754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:30,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:30,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:30,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708961806] [2024-10-10 23:23:30,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:30,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:23:30,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:30,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:23:30,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:23:30,960 INFO L87 Difference]: Start difference. First operand 9766 states and 12262 transitions. Second operand has 4 states, 4 states have (on average 49.25) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:34,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:34,229 INFO L93 Difference]: Finished difference Result 27117 states and 34545 transitions. [2024-10-10 23:23:34,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:23:34,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 3 states have internal predecessors, (197), 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 266 [2024-10-10 23:23:34,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:34,279 INFO L225 Difference]: With dead ends: 27117 [2024-10-10 23:23:34,279 INFO L226 Difference]: Without dead ends: 18029 [2024-10-10 23:23:34,293 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-10 23:23:34,294 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 850 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3409 mSolverCounterSat, 679 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 4088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 679 IncrementalHoareTripleChecker+Valid, 3409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:34,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 362 Invalid, 4088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [679 Valid, 3409 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:23:34,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18029 states. [2024-10-10 23:23:34,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18029 to 15774. [2024-10-10 23:23:34,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15774 states, 15773 states have (on average 1.1934318138591264) internal successors, (18824), 15773 states have internal predecessors, (18824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15774 states to 15774 states and 18824 transitions. [2024-10-10 23:23:34,577 INFO L78 Accepts]: Start accepts. Automaton has 15774 states and 18824 transitions. Word has length 266 [2024-10-10 23:23:34,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:34,577 INFO L471 AbstractCegarLoop]: Abstraction has 15774 states and 18824 transitions. [2024-10-10 23:23:34,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand 15774 states and 18824 transitions. [2024-10-10 23:23:34,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2024-10-10 23:23:34,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:34,586 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:23:34,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:23:34,586 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:34,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:34,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1956085295, now seen corresponding path program 1 times [2024-10-10 23:23:34,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:34,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33285284] [2024-10-10 23:23:34,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:34,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:34,906 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 335 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-10 23:23:34,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:34,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33285284] [2024-10-10 23:23:34,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33285284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:34,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:34,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:34,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912503207] [2024-10-10 23:23:34,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:34,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:34,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:34,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:34,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:34,910 INFO L87 Difference]: Start difference. First operand 15774 states and 18824 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:37,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:37,767 INFO L93 Difference]: Finished difference Result 39057 states and 47477 transitions. [2024-10-10 23:23:37,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:37,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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 377 [2024-10-10 23:23:37,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:37,813 INFO L225 Difference]: With dead ends: 39057 [2024-10-10 23:23:37,813 INFO L226 Difference]: Without dead ends: 24035 [2024-10-10 23:23:37,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:37,833 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 692 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2231 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 2901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 670 IncrementalHoareTripleChecker+Valid, 2231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:37,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 428 Invalid, 2901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [670 Valid, 2231 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:23:37,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24035 states. [2024-10-10 23:23:38,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24035 to 23284. [2024-10-10 23:23:38,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23284 states, 23283 states have (on average 1.1873469913670918) internal successors, (27645), 23283 states have internal predecessors, (27645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:38,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23284 states to 23284 states and 27645 transitions. [2024-10-10 23:23:38,139 INFO L78 Accepts]: Start accepts. Automaton has 23284 states and 27645 transitions. Word has length 377 [2024-10-10 23:23:38,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:38,140 INFO L471 AbstractCegarLoop]: Abstraction has 23284 states and 27645 transitions. [2024-10-10 23:23:38,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:38,141 INFO L276 IsEmpty]: Start isEmpty. Operand 23284 states and 27645 transitions. [2024-10-10 23:23:38,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2024-10-10 23:23:38,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:38,153 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:23:38,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:23:38,153 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:38,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:38,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1435779991, now seen corresponding path program 1 times [2024-10-10 23:23:38,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:38,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886819164] [2024-10-10 23:23:38,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:38,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:38,475 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-10 23:23:38,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:38,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886819164] [2024-10-10 23:23:38,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886819164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:38,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:38,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:38,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181960254] [2024-10-10 23:23:38,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:38,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:38,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:38,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:38,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:38,478 INFO L87 Difference]: Start difference. First operand 23284 states and 27645 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:41,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:41,077 INFO L93 Difference]: Finished difference Result 54828 states and 66469 transitions. [2024-10-10 23:23:41,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:41,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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 405 [2024-10-10 23:23:41,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:41,133 INFO L225 Difference]: With dead ends: 54828 [2024-10-10 23:23:41,133 INFO L226 Difference]: Without dead ends: 32296 [2024-10-10 23:23:41,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:41,166 INFO L432 NwaCegarLoop]: 1206 mSDtfsCounter, 680 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2251 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 2251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:41,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1213 Invalid, 2684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 2251 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:23:41,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32296 states. [2024-10-10 23:23:41,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32296 to 30043. [2024-10-10 23:23:41,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30043 states, 30042 states have (on average 1.1742227548099327) internal successors, (35276), 30042 states have internal predecessors, (35276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30043 states to 30043 states and 35276 transitions. [2024-10-10 23:23:41,569 INFO L78 Accepts]: Start accepts. Automaton has 30043 states and 35276 transitions. Word has length 405 [2024-10-10 23:23:41,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:41,570 INFO L471 AbstractCegarLoop]: Abstraction has 30043 states and 35276 transitions. [2024-10-10 23:23:41,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:41,570 INFO L276 IsEmpty]: Start isEmpty. Operand 30043 states and 35276 transitions. [2024-10-10 23:23:41,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-10-10 23:23:41,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:41,579 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:23:41,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:23:41,580 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:41,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:41,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1525929505, now seen corresponding path program 1 times [2024-10-10 23:23:41,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:41,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107885065] [2024-10-10 23:23:41,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:41,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:42,029 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-10 23:23:42,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:42,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107885065] [2024-10-10 23:23:42,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107885065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:42,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:42,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:42,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112576013] [2024-10-10 23:23:42,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:42,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:42,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:42,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:42,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:42,034 INFO L87 Difference]: Start difference. First operand 30043 states and 35276 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:44,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:44,538 INFO L93 Difference]: Finished difference Result 68346 states and 81731 transitions. [2024-10-10 23:23:44,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:44,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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 409 [2024-10-10 23:23:44,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:44,593 INFO L225 Difference]: With dead ends: 68346 [2024-10-10 23:23:44,593 INFO L226 Difference]: Without dead ends: 39055 [2024-10-10 23:23:44,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:44,623 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 778 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 826 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 2996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 826 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:44,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 121 Invalid, 2996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [826 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:23:44,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39055 states. [2024-10-10 23:23:45,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39055 to 39055. [2024-10-10 23:23:45,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39055 states, 39054 states have (on average 1.193168433451119) internal successors, (46598), 39054 states have internal predecessors, (46598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:45,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39055 states to 39055 states and 46598 transitions. [2024-10-10 23:23:45,311 INFO L78 Accepts]: Start accepts. Automaton has 39055 states and 46598 transitions. Word has length 409 [2024-10-10 23:23:45,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:45,312 INFO L471 AbstractCegarLoop]: Abstraction has 39055 states and 46598 transitions. [2024-10-10 23:23:45,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:45,313 INFO L276 IsEmpty]: Start isEmpty. Operand 39055 states and 46598 transitions. [2024-10-10 23:23:45,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2024-10-10 23:23:45,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:45,322 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:23:45,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:23:45,322 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:45,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:45,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1489111337, now seen corresponding path program 1 times [2024-10-10 23:23:45,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:45,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585397829] [2024-10-10 23:23:45,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:45,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2024-10-10 23:23:45,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:45,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585397829] [2024-10-10 23:23:45,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585397829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:45,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:45,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:45,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273181847] [2024-10-10 23:23:45,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:45,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:45,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:45,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:45,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:45,629 INFO L87 Difference]: Start difference. First operand 39055 states and 46598 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:48,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:48,509 INFO L93 Difference]: Finished difference Result 113406 states and 135804 transitions. [2024-10-10 23:23:48,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:48,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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 413 [2024-10-10 23:23:48,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:48,590 INFO L225 Difference]: With dead ends: 113406 [2024-10-10 23:23:48,590 INFO L226 Difference]: Without dead ends: 75103 [2024-10-10 23:23:48,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:48,607 INFO L432 NwaCegarLoop]: 1338 mSDtfsCounter, 671 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 683 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 2853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 683 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:48,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 1345 Invalid, 2853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [683 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:23:48,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75103 states. [2024-10-10 23:23:49,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75103 to 71348. [2024-10-10 23:23:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71348 states, 71347 states have (on average 1.1435659523175465) internal successors, (81590), 71347 states have internal predecessors, (81590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:49,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71348 states to 71348 states and 81590 transitions. [2024-10-10 23:23:49,697 INFO L78 Accepts]: Start accepts. Automaton has 71348 states and 81590 transitions. Word has length 413 [2024-10-10 23:23:49,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:49,698 INFO L471 AbstractCegarLoop]: Abstraction has 71348 states and 81590 transitions. [2024-10-10 23:23:49,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:49,698 INFO L276 IsEmpty]: Start isEmpty. Operand 71348 states and 81590 transitions. [2024-10-10 23:23:49,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2024-10-10 23:23:49,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:49,712 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:23:49,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:23:49,712 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:49,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:49,713 INFO L85 PathProgramCache]: Analyzing trace with hash 170647591, now seen corresponding path program 1 times [2024-10-10 23:23:49,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:49,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191632252] [2024-10-10 23:23:49,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:49,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:50,521 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-10-10 23:23:50,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:50,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191632252] [2024-10-10 23:23:50,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191632252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:50,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:50,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:50,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558386663] [2024-10-10 23:23:50,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:50,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:50,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:50,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:50,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:50,525 INFO L87 Difference]: Start difference. First operand 71348 states and 81590 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:53,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:53,430 INFO L93 Difference]: Finished difference Result 175739 states and 203334 transitions. [2024-10-10 23:23:53,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:53,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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 475 [2024-10-10 23:23:53,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:53,717 INFO L225 Difference]: With dead ends: 175739 [2024-10-10 23:23:53,717 INFO L226 Difference]: Without dead ends: 101388 [2024-10-10 23:23:53,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:53,781 INFO L432 NwaCegarLoop]: 1269 mSDtfsCounter, 707 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2201 mSolverCounterSat, 611 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 2812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 611 IncrementalHoareTripleChecker+Valid, 2201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:53,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1276 Invalid, 2812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [611 Valid, 2201 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:23:53,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101388 states. [2024-10-10 23:23:54,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101388 to 87870. [2024-10-10 23:23:54,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87870 states, 87869 states have (on average 1.128486724555873) internal successors, (99159), 87869 states have internal predecessors, (99159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:55,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87870 states to 87870 states and 99159 transitions. [2024-10-10 23:23:55,403 INFO L78 Accepts]: Start accepts. Automaton has 87870 states and 99159 transitions. Word has length 475 [2024-10-10 23:23:55,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:55,404 INFO L471 AbstractCegarLoop]: Abstraction has 87870 states and 99159 transitions. [2024-10-10 23:23:55,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:55,404 INFO L276 IsEmpty]: Start isEmpty. Operand 87870 states and 99159 transitions. [2024-10-10 23:23:55,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2024-10-10 23:23:55,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:55,441 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:23:55,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:23:55,442 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:55,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:55,443 INFO L85 PathProgramCache]: Analyzing trace with hash 167989212, now seen corresponding path program 1 times [2024-10-10 23:23:55,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:55,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844701994] [2024-10-10 23:23:55,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:55,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 446 proven. 108 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-10-10 23:23:56,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:56,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844701994] [2024-10-10 23:23:56,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844701994] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:23:56,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427711140] [2024-10-10 23:23:56,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:56,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:23:56,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:23:56,663 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:23:56,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:23:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:56,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:23:56,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:23:57,032 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 499 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-10-10 23:23:57,032 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:23:57,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427711140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:57,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:23:57,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:23:57,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313621303] [2024-10-10 23:23:57,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:57,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:57,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:57,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:57,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:23:57,035 INFO L87 Difference]: Start difference. First operand 87870 states and 99159 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:59,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:59,817 INFO L93 Difference]: Finished difference Result 174988 states and 197561 transitions. [2024-10-10 23:23:59,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:59,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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 546 [2024-10-10 23:23:59,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:59,918 INFO L225 Difference]: With dead ends: 174988 [2024-10-10 23:23:59,919 INFO L226 Difference]: Without dead ends: 87870 [2024-10-10 23:23:59,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:23:59,950 INFO L432 NwaCegarLoop]: 1292 mSDtfsCounter, 684 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2083 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 2627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:59,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1299 Invalid, 2627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2083 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:24:00,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87870 states. [2024-10-10 23:24:00,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87870 to 80360. [2024-10-10 23:24:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80360 states, 80359 states have (on average 1.0942893764233004) internal successors, (87936), 80359 states have internal predecessors, (87936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:24:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80360 states to 80360 states and 87936 transitions. [2024-10-10 23:24:01,045 INFO L78 Accepts]: Start accepts. Automaton has 80360 states and 87936 transitions. Word has length 546 [2024-10-10 23:24:01,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:01,046 INFO L471 AbstractCegarLoop]: Abstraction has 80360 states and 87936 transitions. [2024-10-10 23:24:01,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:24:01,046 INFO L276 IsEmpty]: Start isEmpty. Operand 80360 states and 87936 transitions. [2024-10-10 23:24:01,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2024-10-10 23:24:01,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:01,077 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:24:01,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 23:24:01,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:24:01,279 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:01,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:01,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1091539351, now seen corresponding path program 1 times [2024-10-10 23:24:01,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:01,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905856889] [2024-10-10 23:24:01,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:01,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:01,992 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 415 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-10 23:24:01,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:01,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905856889] [2024-10-10 23:24:01,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905856889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:01,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:01,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:24:01,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66046147] [2024-10-10 23:24:01,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:02,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:24:02,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:02,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:24:02,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:24:02,003 INFO L87 Difference]: Start difference. First operand 80360 states and 87936 transitions. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:24:05,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:05,153 INFO L93 Difference]: Finished difference Result 185500 states and 203472 transitions. [2024-10-10 23:24:05,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:24:05,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 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 640 [2024-10-10 23:24:05,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:05,154 INFO L225 Difference]: With dead ends: 185500 [2024-10-10 23:24:05,154 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:24:05,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:24:05,199 INFO L432 NwaCegarLoop]: 1215 mSDtfsCounter, 442 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 2764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:05,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1221 Invalid, 2764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 2269 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:24:05,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:24:05,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:24:05,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:24:05,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:24:05,200 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 640 [2024-10-10 23:24:05,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:05,200 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:24:05,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:24:05,201 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:24:05,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:24:05,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:24:05,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:24:05,207 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:24:05,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:24:07,043 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:24:07,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:24:07 BoogieIcfgContainer [2024-10-10 23:24:07,067 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:24:07,067 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:24:07,068 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:24:07,068 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:24:07,068 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:23:13" (3/4) ... [2024-10-10 23:24:07,071 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:24:07,129 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-10 23:24:07,135 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:24:07,142 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:24:07,148 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:24:07,550 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:24:07,551 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:24:07,551 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:24:07,552 INFO L158 Benchmark]: Toolchain (without parser) took 60847.23ms. Allocated memory was 167.8MB in the beginning and 9.7GB in the end (delta: 9.5GB). Free memory was 120.3MB in the beginning and 8.6GB in the end (delta: -8.5GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-10-10 23:24:07,552 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:24:07,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1609.65ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 94.0MB in the end (delta: 26.3MB). Peak memory consumption was 109.3MB. Max. memory is 16.1GB. [2024-10-10 23:24:07,553 INFO L158 Benchmark]: Boogie Procedure Inliner took 367.78ms. Allocated memory was 167.8MB in the beginning and 255.9MB in the end (delta: 88.1MB). Free memory was 94.0MB in the beginning and 145.8MB in the end (delta: -51.8MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. [2024-10-10 23:24:07,553 INFO L158 Benchmark]: Boogie Preprocessor took 588.72ms. Allocated memory is still 255.9MB. Free memory was 145.8MB in the beginning and 134.2MB in the end (delta: 11.5MB). Peak memory consumption was 76.5MB. Max. memory is 16.1GB. [2024-10-10 23:24:07,554 INFO L158 Benchmark]: RCFGBuilder took 4666.84ms. Allocated memory was 255.9MB in the beginning and 511.7MB in the end (delta: 255.9MB). Free memory was 134.2MB in the beginning and 194.8MB in the end (delta: -60.5MB). Peak memory consumption was 228.5MB. Max. memory is 16.1GB. [2024-10-10 23:24:07,554 INFO L158 Benchmark]: TraceAbstraction took 53124.01ms. Allocated memory was 511.7MB in the beginning and 9.7GB in the end (delta: 9.2GB). Free memory was 193.7MB in the beginning and 8.2GB in the end (delta: -8.0GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-10-10 23:24:07,555 INFO L158 Benchmark]: Witness Printer took 484.10ms. Allocated memory is still 9.7GB. Free memory was 8.2GB in the beginning and 8.6GB in the end (delta: -411.0MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-10-10 23:24:07,556 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1609.65ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 94.0MB in the end (delta: 26.3MB). Peak memory consumption was 109.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 367.78ms. Allocated memory was 167.8MB in the beginning and 255.9MB in the end (delta: 88.1MB). Free memory was 94.0MB in the beginning and 145.8MB in the end (delta: -51.8MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 588.72ms. Allocated memory is still 255.9MB. Free memory was 145.8MB in the beginning and 134.2MB in the end (delta: 11.5MB). Peak memory consumption was 76.5MB. Max. memory is 16.1GB. * RCFGBuilder took 4666.84ms. Allocated memory was 255.9MB in the beginning and 511.7MB in the end (delta: 255.9MB). Free memory was 134.2MB in the beginning and 194.8MB in the end (delta: -60.5MB). Peak memory consumption was 228.5MB. Max. memory is 16.1GB. * TraceAbstraction took 53124.01ms. Allocated memory was 511.7MB in the beginning and 9.7GB in the end (delta: 9.2GB). Free memory was 193.7MB in the beginning and 8.2GB in the end (delta: -8.0GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 484.10ms. Allocated memory is still 9.7GB. Free memory was 8.2GB in the beginning and 8.6GB in the end (delta: -411.0MB). Peak memory consumption was 17.8MB. 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: 187]: 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, 756 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.2s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 37.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9915 SdHoareTripleChecker+Valid, 33.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9915 mSDsluCounter, 9941 SdHoareTripleChecker+Invalid, 27.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 7731 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30153 IncrementalHoareTripleChecker+Invalid, 37884 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7731 mSolverCounterUnsat, 9841 mSDtfsCounter, 30153 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 781 GetRequests, 761 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87870occurred in iteration=11, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 30042 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 4843 NumberOfCodeBlocks, 4843 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4828 ConstructedInterpolants, 0 QuantifiedInterpolants, 13823 SizeOfPredicates, 0 NumberOfNonLiveVariables, 973 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 4871/5022 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: 4828]: Loop Invariant Derived loop invariant: ((((((a24 == 14) || (255 < a17)) || (a24 == 13)) || (a17 < 112)) || (3 < a5)) || (a7 != 12)) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:24:07,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE