./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label50.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56e7a4db9e890bad4c6ba22e9e20439c94d0afdecfe3e8cad4ffb71abf5e0a33 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:50:48,882 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:50:48,941 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:50:48,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:50:48,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:50:48,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:50:48,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:50:48,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:50:48,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:50:48,973 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:50:48,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:50:48,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:50:48,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:50:48,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:50:48,974 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:50:48,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:50:48,974 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:50:48,974 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:50:48,974 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:50:48,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:50:48,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:50:48,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:50:48,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:50:48,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:50:48,976 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:50:48,977 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:50:48,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:50:48,977 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:50:48,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:50:48,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:50:48,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:50:48,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:50:48,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:50:48,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:50:48,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:50:48,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:50:48,979 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:50:48,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:50:48,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:50:48,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:50:48,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:50:48,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:50:48,980 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 56e7a4db9e890bad4c6ba22e9e20439c94d0afdecfe3e8cad4ffb71abf5e0a33 [2024-11-11 16:50:49,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:50:49,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:50:49,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:50:49,224 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:50:49,225 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:50:49,226 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label50.c [2024-11-11 16:50:50,570 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:50:50,808 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:50:50,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label50.c [2024-11-11 16:50:50,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5792c768f/7ad41ffb6952433ea67d505253c4d90e/FLAGf67db53c1 [2024-11-11 16:50:50,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5792c768f/7ad41ffb6952433ea67d505253c4d90e [2024-11-11 16:50:50,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:50:50,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:50:50,876 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:50:50,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:50:50,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:50:50,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:50:50" (1/1) ... [2024-11-11 16:50:50,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d018086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:50, skipping insertion in model container [2024-11-11 16:50:50,884 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:50:50" (1/1) ... [2024-11-11 16:50:50,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:50:51,186 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label50.c[5287,5300] [2024-11-11 16:50:51,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:50:51,378 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:50:51,402 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label50.c[5287,5300] [2024-11-11 16:50:51,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:50:51,515 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:50:51,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:51 WrapperNode [2024-11-11 16:50:51,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:50:51,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:50:51,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:50:51,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:50:51,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:51" (1/1) ... [2024-11-11 16:50:51,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:51" (1/1) ... [2024-11-11 16:50:51,621 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-11 16:50:51,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:50:51,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:50:51,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:50:51,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:50:51,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:51" (1/1) ... [2024-11-11 16:50:51,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:51" (1/1) ... [2024-11-11 16:50:51,649 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:51" (1/1) ... [2024-11-11 16:50:51,682 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 16:50:51,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:51" (1/1) ... [2024-11-11 16:50:51,683 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:51" (1/1) ... [2024-11-11 16:50:51,708 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:51" (1/1) ... [2024-11-11 16:50:51,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:51" (1/1) ... [2024-11-11 16:50:51,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:51" (1/1) ... [2024-11-11 16:50:51,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:51" (1/1) ... [2024-11-11 16:50:51,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:50:51,748 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:50:51,748 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:50:51,748 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:50:51,748 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:51" (1/1) ... [2024-11-11 16:50:51,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:50:51,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:50:51,774 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 16:50:51,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 16:50:51,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:50:51,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:50:51,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:50:51,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:50:51,889 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:50:51,891 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:50:53,070 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-11 16:50:53,070 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:50:53,091 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:50:53,092 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 16:50:53,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:50:53 BoogieIcfgContainer [2024-11-11 16:50:53,093 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:50:53,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:50:53,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:50:53,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:50:53,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:50:50" (1/3) ... [2024-11-11 16:50:53,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689d04d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:50:53, skipping insertion in model container [2024-11-11 16:50:53,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:50:51" (2/3) ... [2024-11-11 16:50:53,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689d04d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:50:53, skipping insertion in model container [2024-11-11 16:50:53,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:50:53" (3/3) ... [2024-11-11 16:50:53,101 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label50.c [2024-11-11 16:50:53,114 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:50:53,115 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:50:53,174 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:50:53,180 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;@293ca6b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:50:53,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:50:53,185 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:53,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-11 16:50:53,192 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:53,193 INFO L218 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] [2024-11-11 16:50:53,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:53,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:53,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1318097310, now seen corresponding path program 1 times [2024-11-11 16:50:53,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:53,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19991922] [2024-11-11 16:50:53,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:53,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:53,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:50:53,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:53,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19991922] [2024-11-11 16:50:53,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19991922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:53,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:53,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:50:53,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913046149] [2024-11-11 16:50:53,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:53,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:53,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:53,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:53,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:53,616 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:54,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:54,439 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2024-11-11 16:50:54,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:54,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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 36 [2024-11-11 16:50:54,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:54,450 INFO L225 Difference]: With dead ends: 776 [2024-11-11 16:50:54,451 INFO L226 Difference]: Without dead ends: 413 [2024-11-11 16:50:54,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:54,456 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 191 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:54,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 196 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:50:54,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-11 16:50:54,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2024-11-11 16:50:54,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:54,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2024-11-11 16:50:54,535 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 36 [2024-11-11 16:50:54,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:54,535 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2024-11-11 16:50:54,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:54,536 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2024-11-11 16:50:54,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 16:50:54,539 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:54,539 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:50:54,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 16:50:54,539 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:54,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:54,540 INFO L85 PathProgramCache]: Analyzing trace with hash -464053414, now seen corresponding path program 1 times [2024-11-11 16:50:54,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:54,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309714867] [2024-11-11 16:50:54,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:54,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:50:54,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:54,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309714867] [2024-11-11 16:50:54,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309714867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:54,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:54,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:50:54,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590903762] [2024-11-11 16:50:54,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:54,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:54,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:54,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:54,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:54,698 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:55,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:55,317 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2024-11-11 16:50:55,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:55,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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 104 [2024-11-11 16:50:55,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:55,320 INFO L225 Difference]: With dead ends: 1209 [2024-11-11 16:50:55,320 INFO L226 Difference]: Without dead ends: 800 [2024-11-11 16:50:55,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:55,322 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:55,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:50:55,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-11 16:50:55,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2024-11-11 16:50:55,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3854961832061068) internal successors, (1089), 786 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1089 transitions. [2024-11-11 16:50:55,341 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1089 transitions. Word has length 104 [2024-11-11 16:50:55,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:55,341 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1089 transitions. [2024-11-11 16:50:55,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:55,341 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1089 transitions. [2024-11-11 16:50:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-11 16:50:55,342 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:55,343 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:50:55,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 16:50:55,343 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:55,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:55,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1589161308, now seen corresponding path program 1 times [2024-11-11 16:50:55,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:55,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760223418] [2024-11-11 16:50:55,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:55,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:50:55,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:55,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760223418] [2024-11-11 16:50:55,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760223418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:55,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:55,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:50:55,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684502756] [2024-11-11 16:50:55,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:55,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:55,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:55,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:55,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:55,668 INFO L87 Difference]: Start difference. First operand 787 states and 1089 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:56,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:56,282 INFO L93 Difference]: Finished difference Result 1942 states and 2631 transitions. [2024-11-11 16:50:56,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:56,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-11-11 16:50:56,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:56,286 INFO L225 Difference]: With dead ends: 1942 [2024-11-11 16:50:56,286 INFO L226 Difference]: Without dead ends: 1157 [2024-11-11 16:50:56,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:56,288 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:56,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:50:56,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-11-11 16:50:56,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2024-11-11 16:50:56,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.277922077922078) internal successors, (1476), 1155 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:56,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1476 transitions. [2024-11-11 16:50:56,305 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1476 transitions. Word has length 105 [2024-11-11 16:50:56,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:56,305 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1476 transitions. [2024-11-11 16:50:56,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:56,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1476 transitions. [2024-11-11 16:50:56,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-11 16:50:56,307 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:56,307 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:50:56,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 16:50:56,308 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:56,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:56,308 INFO L85 PathProgramCache]: Analyzing trace with hash 649803806, now seen corresponding path program 1 times [2024-11-11 16:50:56,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:56,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734231620] [2024-11-11 16:50:56,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:56,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:50:56,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:56,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734231620] [2024-11-11 16:50:56,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734231620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:56,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:56,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:50:56,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508006231] [2024-11-11 16:50:56,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:56,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:56,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:56,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:56,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:56,612 INFO L87 Difference]: Start difference. First operand 1156 states and 1476 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:57,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:57,543 INFO L93 Difference]: Finished difference Result 2691 states and 3515 transitions. [2024-11-11 16:50:57,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:57,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2024-11-11 16:50:57,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:57,549 INFO L225 Difference]: With dead ends: 2691 [2024-11-11 16:50:57,549 INFO L226 Difference]: Without dead ends: 1721 [2024-11-11 16:50:57,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:57,551 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 170 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:57,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 336 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 16:50:57,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2024-11-11 16:50:57,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1528. [2024-11-11 16:50:57,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1528 states, 1527 states have (on average 1.261296660117878) internal successors, (1926), 1527 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:57,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 1926 transitions. [2024-11-11 16:50:57,575 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 1926 transitions. Word has length 148 [2024-11-11 16:50:57,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:57,576 INFO L471 AbstractCegarLoop]: Abstraction has 1528 states and 1926 transitions. [2024-11-11 16:50:57,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:57,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1926 transitions. [2024-11-11 16:50:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-11 16:50:57,578 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:57,578 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:50:57,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 16:50:57,579 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:57,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:57,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1095020807, now seen corresponding path program 1 times [2024-11-11 16:50:57,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:57,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087628196] [2024-11-11 16:50:57,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:57,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:57,708 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:50:57,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:57,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087628196] [2024-11-11 16:50:57,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087628196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:57,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:57,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:50:57,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063019124] [2024-11-11 16:50:57,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:57,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:57,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:57,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:57,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:57,711 INFO L87 Difference]: Start difference. First operand 1528 states and 1926 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:58,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:58,385 INFO L93 Difference]: Finished difference Result 4158 states and 5316 transitions. [2024-11-11 16:50:58,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:58,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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 163 [2024-11-11 16:50:58,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:58,393 INFO L225 Difference]: With dead ends: 4158 [2024-11-11 16:50:58,394 INFO L226 Difference]: Without dead ends: 2632 [2024-11-11 16:50:58,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:58,396 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 115 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:58,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 155 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:50:58,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2632 states. [2024-11-11 16:50:58,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2632 to 2448. [2024-11-11 16:50:58,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2448 states, 2447 states have (on average 1.2174090723334696) internal successors, (2979), 2447 states have internal predecessors, (2979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:58,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2448 states and 2979 transitions. [2024-11-11 16:50:58,437 INFO L78 Accepts]: Start accepts. Automaton has 2448 states and 2979 transitions. Word has length 163 [2024-11-11 16:50:58,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:58,438 INFO L471 AbstractCegarLoop]: Abstraction has 2448 states and 2979 transitions. [2024-11-11 16:50:58,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:58,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 2979 transitions. [2024-11-11 16:50:58,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 16:50:58,440 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:58,440 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:50:58,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 16:50:58,441 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:58,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:58,441 INFO L85 PathProgramCache]: Analyzing trace with hash 653368921, now seen corresponding path program 1 times [2024-11-11 16:50:58,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:58,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173581234] [2024-11-11 16:50:58,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:58,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:58,681 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:50:58,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:58,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173581234] [2024-11-11 16:50:58,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173581234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:58,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:58,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:50:58,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882515949] [2024-11-11 16:50:58,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:58,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:58,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:58,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:58,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:58,683 INFO L87 Difference]: Start difference. First operand 2448 states and 2979 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:59,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:59,304 INFO L93 Difference]: Finished difference Result 5639 states and 6868 transitions. [2024-11-11 16:50:59,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:50:59,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 179 [2024-11-11 16:50:59,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:59,312 INFO L225 Difference]: With dead ends: 5639 [2024-11-11 16:50:59,312 INFO L226 Difference]: Without dead ends: 3193 [2024-11-11 16:50:59,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:59,316 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 165 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:59,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 359 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:50:59,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2024-11-11 16:50:59,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 3184. [2024-11-11 16:50:59,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3184 states, 3183 states have (on average 1.1991831605403707) internal successors, (3817), 3183 states have internal predecessors, (3817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:59,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 3817 transitions. [2024-11-11 16:50:59,356 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 3817 transitions. Word has length 179 [2024-11-11 16:50:59,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:59,357 INFO L471 AbstractCegarLoop]: Abstraction has 3184 states and 3817 transitions. [2024-11-11 16:50:59,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:59,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 3817 transitions. [2024-11-11 16:50:59,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-11 16:50:59,359 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:50:59,359 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:50:59,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 16:50:59,359 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:50:59,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:50:59,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1472633207, now seen corresponding path program 1 times [2024-11-11 16:50:59,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:50:59,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7546588] [2024-11-11 16:50:59,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:50:59,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:50:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:50:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-11 16:50:59,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:50:59,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7546588] [2024-11-11 16:50:59,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7546588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:50:59,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:50:59,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:50:59,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705655358] [2024-11-11 16:50:59,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:50:59,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:50:59,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:59,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:50:59,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:50:59,609 INFO L87 Difference]: Start difference. First operand 3184 states and 3817 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:00,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:00,305 INFO L93 Difference]: Finished difference Result 7108 states and 8504 transitions. [2024-11-11 16:51:00,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:00,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 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 217 [2024-11-11 16:51:00,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:00,314 INFO L225 Difference]: With dead ends: 7108 [2024-11-11 16:51:00,315 INFO L226 Difference]: Without dead ends: 3926 [2024-11-11 16:51:00,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:00,319 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 37 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:00,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 154 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:51:00,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3926 states. [2024-11-11 16:51:00,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3926 to 3925. [2024-11-11 16:51:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3925 states, 3924 states have (on average 1.193934760448522) internal successors, (4685), 3924 states have internal predecessors, (4685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:00,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 4685 transitions. [2024-11-11 16:51:00,363 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 4685 transitions. Word has length 217 [2024-11-11 16:51:00,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:00,363 INFO L471 AbstractCegarLoop]: Abstraction has 3925 states and 4685 transitions. [2024-11-11 16:51:00,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:00,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 4685 transitions. [2024-11-11 16:51:00,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-11 16:51:00,365 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:00,365 INFO L218 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, 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] [2024-11-11 16:51:00,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 16:51:00,366 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:00,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:00,366 INFO L85 PathProgramCache]: Analyzing trace with hash -760864207, now seen corresponding path program 1 times [2024-11-11 16:51:00,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:00,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587292821] [2024-11-11 16:51:00,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:00,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:00,534 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-11 16:51:00,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:00,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587292821] [2024-11-11 16:51:00,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587292821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:00,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:00,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:00,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004928731] [2024-11-11 16:51:00,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:00,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:00,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:00,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:00,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:00,536 INFO L87 Difference]: Start difference. First operand 3925 states and 4685 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:01,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:01,248 INFO L93 Difference]: Finished difference Result 8591 states and 10347 transitions. [2024-11-11 16:51:01,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:01,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 218 [2024-11-11 16:51:01,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:01,258 INFO L225 Difference]: With dead ends: 8591 [2024-11-11 16:51:01,259 INFO L226 Difference]: Without dead ends: 4668 [2024-11-11 16:51:01,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:01,263 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 161 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:01,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 390 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:51:01,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2024-11-11 16:51:01,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4477. [2024-11-11 16:51:01,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4477 states, 4476 states have (on average 1.1861036639857014) internal successors, (5309), 4476 states have internal predecessors, (5309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4477 states to 4477 states and 5309 transitions. [2024-11-11 16:51:01,313 INFO L78 Accepts]: Start accepts. Automaton has 4477 states and 5309 transitions. Word has length 218 [2024-11-11 16:51:01,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:01,313 INFO L471 AbstractCegarLoop]: Abstraction has 4477 states and 5309 transitions. [2024-11-11 16:51:01,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:01,313 INFO L276 IsEmpty]: Start isEmpty. Operand 4477 states and 5309 transitions. [2024-11-11 16:51:01,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-11 16:51:01,315 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:01,315 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:01,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 16:51:01,316 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:01,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:01,316 INFO L85 PathProgramCache]: Analyzing trace with hash 43300159, now seen corresponding path program 1 times [2024-11-11 16:51:01,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:01,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750117327] [2024-11-11 16:51:01,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:01,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:01,599 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:51:01,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:01,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750117327] [2024-11-11 16:51:01,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750117327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:01,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:01,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:51:01,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302583776] [2024-11-11 16:51:01,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:01,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:51:01,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:01,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:51:01,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:01,602 INFO L87 Difference]: Start difference. First operand 4477 states and 5309 transitions. Second operand has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:02,615 INFO L93 Difference]: Finished difference Result 14321 states and 17014 transitions. [2024-11-11 16:51:02,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:02,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 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 238 [2024-11-11 16:51:02,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:02,644 INFO L225 Difference]: With dead ends: 14321 [2024-11-11 16:51:02,644 INFO L226 Difference]: Without dead ends: 9846 [2024-11-11 16:51:02,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:02,649 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 302 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:02,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 191 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 16:51:02,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9846 states. [2024-11-11 16:51:02,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9846 to 7627. [2024-11-11 16:51:02,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7627 states, 7626 states have (on average 1.1702071859428271) internal successors, (8924), 7626 states have internal predecessors, (8924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:02,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7627 states to 7627 states and 8924 transitions. [2024-11-11 16:51:02,779 INFO L78 Accepts]: Start accepts. Automaton has 7627 states and 8924 transitions. Word has length 238 [2024-11-11 16:51:02,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:02,780 INFO L471 AbstractCegarLoop]: Abstraction has 7627 states and 8924 transitions. [2024-11-11 16:51:02,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:02,780 INFO L276 IsEmpty]: Start isEmpty. Operand 7627 states and 8924 transitions. [2024-11-11 16:51:02,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-11 16:51:02,784 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:02,784 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:02,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 16:51:02,785 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:02,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:02,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1310756102, now seen corresponding path program 1 times [2024-11-11 16:51:02,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:02,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959642917] [2024-11-11 16:51:02,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:02,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:03,041 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:51:03,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:03,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959642917] [2024-11-11 16:51:03,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959642917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:03,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:03,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:51:03,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76417834] [2024-11-11 16:51:03,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:03,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:51:03,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:03,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:51:03,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:03,045 INFO L87 Difference]: Start difference. First operand 7627 states and 8924 transitions. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:04,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:04,324 INFO L93 Difference]: Finished difference Result 20234 states and 23746 transitions. [2024-11-11 16:51:04,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:04,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 248 [2024-11-11 16:51:04,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:04,357 INFO L225 Difference]: With dead ends: 20234 [2024-11-11 16:51:04,358 INFO L226 Difference]: Without dead ends: 12609 [2024-11-11 16:51:04,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:04,367 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 316 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:04,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 113 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 16:51:04,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12609 states. [2024-11-11 16:51:04,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12609 to 10202. [2024-11-11 16:51:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10202 states, 10201 states have (on average 1.1734143711400844) internal successors, (11970), 10201 states have internal predecessors, (11970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:04,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10202 states to 10202 states and 11970 transitions. [2024-11-11 16:51:04,497 INFO L78 Accepts]: Start accepts. Automaton has 10202 states and 11970 transitions. Word has length 248 [2024-11-11 16:51:04,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:04,498 INFO L471 AbstractCegarLoop]: Abstraction has 10202 states and 11970 transitions. [2024-11-11 16:51:04,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:04,498 INFO L276 IsEmpty]: Start isEmpty. Operand 10202 states and 11970 transitions. [2024-11-11 16:51:04,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-11 16:51:04,501 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:04,501 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:04,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 16:51:04,501 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:04,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:04,502 INFO L85 PathProgramCache]: Analyzing trace with hash -499731777, now seen corresponding path program 1 times [2024-11-11 16:51:04,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:04,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021001784] [2024-11-11 16:51:04,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:04,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:51:04,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:04,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021001784] [2024-11-11 16:51:04,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021001784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:04,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:04,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:04,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510840687] [2024-11-11 16:51:04,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:04,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:04,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:04,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:04,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:04,675 INFO L87 Difference]: Start difference. First operand 10202 states and 11970 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:05,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:05,286 INFO L93 Difference]: Finished difference Result 20399 states and 23935 transitions. [2024-11-11 16:51:05,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:05,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 248 [2024-11-11 16:51:05,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:05,301 INFO L225 Difference]: With dead ends: 20399 [2024-11-11 16:51:05,302 INFO L226 Difference]: Without dead ends: 10199 [2024-11-11 16:51:05,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:05,312 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 148 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:05,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 305 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:51:05,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10199 states. [2024-11-11 16:51:05,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10199 to 10199. [2024-11-11 16:51:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10199 states, 10198 states have (on average 1.1445381447342615) internal successors, (11672), 10198 states have internal predecessors, (11672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:05,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10199 states to 10199 states and 11672 transitions. [2024-11-11 16:51:05,416 INFO L78 Accepts]: Start accepts. Automaton has 10199 states and 11672 transitions. Word has length 248 [2024-11-11 16:51:05,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:05,416 INFO L471 AbstractCegarLoop]: Abstraction has 10199 states and 11672 transitions. [2024-11-11 16:51:05,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:05,417 INFO L276 IsEmpty]: Start isEmpty. Operand 10199 states and 11672 transitions. [2024-11-11 16:51:05,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-11 16:51:05,420 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:05,420 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:05,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 16:51:05,421 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:05,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:05,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1714177798, now seen corresponding path program 1 times [2024-11-11 16:51:05,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:05,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342959163] [2024-11-11 16:51:05,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:05,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:05,760 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 39 proven. 28 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-11 16:51:05,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:05,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342959163] [2024-11-11 16:51:05,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342959163] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:51:05,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109564494] [2024-11-11 16:51:05,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:05,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:51:05,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:51:05,762 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:51:05,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 16:51:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:05,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:51:05,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:51:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-11 16:51:05,971 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:51:05,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109564494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:05,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:51:05,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-11 16:51:05,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948577085] [2024-11-11 16:51:05,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:05,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:05,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:05,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:05,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:51:05,973 INFO L87 Difference]: Start difference. First operand 10199 states and 11672 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:06,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:06,696 INFO L93 Difference]: Finished difference Result 22787 states and 26113 transitions. [2024-11-11 16:51:06,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:06,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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 250 [2024-11-11 16:51:06,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:06,711 INFO L225 Difference]: With dead ends: 22787 [2024-11-11 16:51:06,711 INFO L226 Difference]: Without dead ends: 12590 [2024-11-11 16:51:06,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:51:06,720 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 162 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:06,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 370 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:51:06,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12590 states. [2024-11-11 16:51:06,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12590 to 11114. [2024-11-11 16:51:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11114 states, 11113 states have (on average 1.1383064878970575) internal successors, (12650), 11113 states have internal predecessors, (12650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:06,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11114 states to 11114 states and 12650 transitions. [2024-11-11 16:51:06,868 INFO L78 Accepts]: Start accepts. Automaton has 11114 states and 12650 transitions. Word has length 250 [2024-11-11 16:51:06,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:06,868 INFO L471 AbstractCegarLoop]: Abstraction has 11114 states and 12650 transitions. [2024-11-11 16:51:06,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:06,869 INFO L276 IsEmpty]: Start isEmpty. Operand 11114 states and 12650 transitions. [2024-11-11 16:51:06,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-11 16:51:06,873 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:06,873 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:06,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 16:51:07,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-11 16:51:07,077 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:07,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:07,078 INFO L85 PathProgramCache]: Analyzing trace with hash 360106579, now seen corresponding path program 1 times [2024-11-11 16:51:07,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:07,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091503883] [2024-11-11 16:51:07,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:07,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:07,300 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-11 16:51:07,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:07,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091503883] [2024-11-11 16:51:07,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091503883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:07,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:07,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:07,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599000707] [2024-11-11 16:51:07,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:07,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:07,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:07,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:07,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:07,302 INFO L87 Difference]: Start difference. First operand 11114 states and 12650 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:07,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:07,957 INFO L93 Difference]: Finished difference Result 22413 states and 25494 transitions. [2024-11-11 16:51:07,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:07,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 255 [2024-11-11 16:51:07,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:07,970 INFO L225 Difference]: With dead ends: 22413 [2024-11-11 16:51:07,970 INFO L226 Difference]: Without dead ends: 11301 [2024-11-11 16:51:07,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:07,979 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 164 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:07,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 373 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:51:07,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11301 states. [2024-11-11 16:51:08,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11301 to 11113. [2024-11-11 16:51:08,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11113 states, 11112 states have (on average 1.1175305975521959) internal successors, (12418), 11112 states have internal predecessors, (12418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:08,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11113 states to 11113 states and 12418 transitions. [2024-11-11 16:51:08,156 INFO L78 Accepts]: Start accepts. Automaton has 11113 states and 12418 transitions. Word has length 255 [2024-11-11 16:51:08,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:08,157 INFO L471 AbstractCegarLoop]: Abstraction has 11113 states and 12418 transitions. [2024-11-11 16:51:08,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:08,157 INFO L276 IsEmpty]: Start isEmpty. Operand 11113 states and 12418 transitions. [2024-11-11 16:51:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-11 16:51:08,161 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:08,161 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:08,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 16:51:08,162 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:08,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:08,162 INFO L85 PathProgramCache]: Analyzing trace with hash 2039816122, now seen corresponding path program 1 times [2024-11-11 16:51:08,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:08,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562326319] [2024-11-11 16:51:08,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:08,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:08,667 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 123 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:51:08,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:08,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562326319] [2024-11-11 16:51:08,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562326319] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:51:08,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625900459] [2024-11-11 16:51:08,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:08,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:51:08,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:51:08,673 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:51:08,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 16:51:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:08,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 16:51:08,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:51:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:51:09,499 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:51:09,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625900459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:09,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:51:09,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-11 16:51:09,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235233666] [2024-11-11 16:51:09,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:09,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:51:09,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:09,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:51:09,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:51:09,501 INFO L87 Difference]: Start difference. First operand 11113 states and 12418 transitions. Second operand has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:10,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:10,303 INFO L93 Difference]: Finished difference Result 22227 states and 24838 transitions. [2024-11-11 16:51:10,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:10,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 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 269 [2024-11-11 16:51:10,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:10,316 INFO L225 Difference]: With dead ends: 22227 [2024-11-11 16:51:10,316 INFO L226 Difference]: Without dead ends: 11116 [2024-11-11 16:51:10,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:51:10,324 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 187 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:10,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 155 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:51:10,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11116 states. [2024-11-11 16:51:10,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11116 to 11113. [2024-11-11 16:51:10,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11113 states, 11112 states have (on average 1.1164506839452844) internal successors, (12406), 11112 states have internal predecessors, (12406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:10,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11113 states to 11113 states and 12406 transitions. [2024-11-11 16:51:10,561 INFO L78 Accepts]: Start accepts. Automaton has 11113 states and 12406 transitions. Word has length 269 [2024-11-11 16:51:10,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:10,561 INFO L471 AbstractCegarLoop]: Abstraction has 11113 states and 12406 transitions. [2024-11-11 16:51:10,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:10,562 INFO L276 IsEmpty]: Start isEmpty. Operand 11113 states and 12406 transitions. [2024-11-11 16:51:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2024-11-11 16:51:10,565 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:10,566 INFO L218 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:10,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 16:51:10,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-11 16:51:10,770 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:10,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:10,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1065717957, now seen corresponding path program 1 times [2024-11-11 16:51:10,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:10,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090807868] [2024-11-11 16:51:10,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:10,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:10,977 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2024-11-11 16:51:10,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:10,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090807868] [2024-11-11 16:51:10,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090807868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:10,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:10,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:10,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565241197] [2024-11-11 16:51:10,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:10,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:10,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:10,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:10,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:10,979 INFO L87 Difference]: Start difference. First operand 11113 states and 12406 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:11,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:11,531 INFO L93 Difference]: Finished difference Result 23512 states and 26255 transitions. [2024-11-11 16:51:11,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:11,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 303 [2024-11-11 16:51:11,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:11,543 INFO L225 Difference]: With dead ends: 23512 [2024-11-11 16:51:11,544 INFO L226 Difference]: Without dead ends: 12401 [2024-11-11 16:51:11,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:11,553 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 157 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:11,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 382 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:51:11,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12401 states. [2024-11-11 16:51:11,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12401 to 11849. [2024-11-11 16:51:11,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11849 states, 11848 states have (on average 1.112255232950709) internal successors, (13178), 11848 states have internal predecessors, (13178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:11,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11849 states to 11849 states and 13178 transitions. [2024-11-11 16:51:11,718 INFO L78 Accepts]: Start accepts. Automaton has 11849 states and 13178 transitions. Word has length 303 [2024-11-11 16:51:11,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:11,718 INFO L471 AbstractCegarLoop]: Abstraction has 11849 states and 13178 transitions. [2024-11-11 16:51:11,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 11849 states and 13178 transitions. [2024-11-11 16:51:11,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-11-11 16:51:11,726 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:11,727 INFO L218 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:11,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 16:51:11,727 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:11,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:11,728 INFO L85 PathProgramCache]: Analyzing trace with hash -698824767, now seen corresponding path program 1 times [2024-11-11 16:51:11,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:11,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6577419] [2024-11-11 16:51:11,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:11,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-11 16:51:12,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:12,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6577419] [2024-11-11 16:51:12,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6577419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:12,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:12,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:51:12,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365813197] [2024-11-11 16:51:12,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:12,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:51:12,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:12,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:51:12,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:12,294 INFO L87 Difference]: Start difference. First operand 11849 states and 13178 transitions. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:13,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:13,658 INFO L93 Difference]: Finished difference Result 29438 states and 32746 transitions. [2024-11-11 16:51:13,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:13,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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 307 [2024-11-11 16:51:13,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:13,675 INFO L225 Difference]: With dead ends: 29438 [2024-11-11 16:51:13,675 INFO L226 Difference]: Without dead ends: 16850 [2024-11-11 16:51:13,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:13,680 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 303 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:13,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 421 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 16:51:13,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16850 states. [2024-11-11 16:51:13,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16850 to 13338. [2024-11-11 16:51:13,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13338 states, 13337 states have (on average 1.1131438854315063) internal successors, (14846), 13337 states have internal predecessors, (14846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:13,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13338 states to 13338 states and 14846 transitions. [2024-11-11 16:51:13,796 INFO L78 Accepts]: Start accepts. Automaton has 13338 states and 14846 transitions. Word has length 307 [2024-11-11 16:51:13,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:13,796 INFO L471 AbstractCegarLoop]: Abstraction has 13338 states and 14846 transitions. [2024-11-11 16:51:13,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:13,796 INFO L276 IsEmpty]: Start isEmpty. Operand 13338 states and 14846 transitions. [2024-11-11 16:51:13,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-11-11 16:51:13,802 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:13,802 INFO L218 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:13,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 16:51:13,802 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:13,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:13,803 INFO L85 PathProgramCache]: Analyzing trace with hash -2127545959, now seen corresponding path program 1 times [2024-11-11 16:51:13,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:13,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615817408] [2024-11-11 16:51:13,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:13,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:14,045 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-11 16:51:14,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:14,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615817408] [2024-11-11 16:51:14,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615817408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:14,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:14,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:51:14,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878482651] [2024-11-11 16:51:14,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:14,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:51:14,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:14,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:51:14,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:14,048 INFO L87 Difference]: Start difference. First operand 13338 states and 14846 transitions. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:15,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:15,157 INFO L93 Difference]: Finished difference Result 34066 states and 37871 transitions. [2024-11-11 16:51:15,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:15,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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 323 [2024-11-11 16:51:15,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:15,181 INFO L225 Difference]: With dead ends: 34066 [2024-11-11 16:51:15,181 INFO L226 Difference]: Without dead ends: 20730 [2024-11-11 16:51:15,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:15,193 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 327 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:15,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 87 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 16:51:15,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20730 states. [2024-11-11 16:51:15,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20730 to 19063. [2024-11-11 16:51:15,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19063 states, 19062 states have (on average 1.1078585667820795) internal successors, (21118), 19062 states have internal predecessors, (21118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:15,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19063 states to 19063 states and 21118 transitions. [2024-11-11 16:51:15,392 INFO L78 Accepts]: Start accepts. Automaton has 19063 states and 21118 transitions. Word has length 323 [2024-11-11 16:51:15,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:15,393 INFO L471 AbstractCegarLoop]: Abstraction has 19063 states and 21118 transitions. [2024-11-11 16:51:15,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 19063 states and 21118 transitions. [2024-11-11 16:51:15,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-11 16:51:15,400 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:15,400 INFO L218 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:15,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 16:51:15,401 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:15,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:15,401 INFO L85 PathProgramCache]: Analyzing trace with hash -409863096, now seen corresponding path program 1 times [2024-11-11 16:51:15,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:15,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008750323] [2024-11-11 16:51:15,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:15,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-11 16:51:15,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:15,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008750323] [2024-11-11 16:51:15,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008750323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:15,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:15,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:15,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991643230] [2024-11-11 16:51:15,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:15,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:15,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:15,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:15,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:15,531 INFO L87 Difference]: Start difference. First operand 19063 states and 21118 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:16,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:16,069 INFO L93 Difference]: Finished difference Result 40515 states and 44895 transitions. [2024-11-11 16:51:16,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:16,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 332 [2024-11-11 16:51:16,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:16,088 INFO L225 Difference]: With dead ends: 40515 [2024-11-11 16:51:16,089 INFO L226 Difference]: Without dead ends: 21454 [2024-11-11 16:51:16,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:16,102 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 185 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:16,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 144 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:51:16,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21454 states. [2024-11-11 16:51:16,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21454 to 19058. [2024-11-11 16:51:16,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19058 states, 19057 states have (on average 1.108306658970457) internal successors, (21121), 19057 states have internal predecessors, (21121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:16,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19058 states to 19058 states and 21121 transitions. [2024-11-11 16:51:16,279 INFO L78 Accepts]: Start accepts. Automaton has 19058 states and 21121 transitions. Word has length 332 [2024-11-11 16:51:16,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:16,279 INFO L471 AbstractCegarLoop]: Abstraction has 19058 states and 21121 transitions. [2024-11-11 16:51:16,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:16,280 INFO L276 IsEmpty]: Start isEmpty. Operand 19058 states and 21121 transitions. [2024-11-11 16:51:16,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-11-11 16:51:16,285 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:16,285 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:51:16,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 16:51:16,286 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:16,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:16,286 INFO L85 PathProgramCache]: Analyzing trace with hash -359061517, now seen corresponding path program 1 times [2024-11-11 16:51:16,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:16,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347853200] [2024-11-11 16:51:16,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:16,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:16,505 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-11 16:51:16,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:16,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347853200] [2024-11-11 16:51:16,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347853200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:16,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:16,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:51:16,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503019689] [2024-11-11 16:51:16,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:16,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:51:16,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:16,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:51:16,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:16,507 INFO L87 Difference]: Start difference. First operand 19058 states and 21121 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:17,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:17,209 INFO L93 Difference]: Finished difference Result 40702 states and 45085 transitions. [2024-11-11 16:51:17,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:51:17,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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 334 [2024-11-11 16:51:17,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:17,232 INFO L225 Difference]: With dead ends: 40702 [2024-11-11 16:51:17,232 INFO L226 Difference]: Without dead ends: 21646 [2024-11-11 16:51:17,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:51:17,246 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 186 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:17,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 135 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:51:17,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21646 states. [2024-11-11 16:51:17,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21646 to 17385. [2024-11-11 16:51:17,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17385 states, 17384 states have (on average 1.1077427519558214) internal successors, (19257), 17384 states have internal predecessors, (19257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:17,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17385 states to 17385 states and 19257 transitions. [2024-11-11 16:51:17,420 INFO L78 Accepts]: Start accepts. Automaton has 17385 states and 19257 transitions. Word has length 334 [2024-11-11 16:51:17,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:17,420 INFO L471 AbstractCegarLoop]: Abstraction has 17385 states and 19257 transitions. [2024-11-11 16:51:17,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:17,420 INFO L276 IsEmpty]: Start isEmpty. Operand 17385 states and 19257 transitions. [2024-11-11 16:51:17,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-11-11 16:51:17,427 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:51:17,427 INFO L218 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:17,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 16:51:17,427 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:51:17,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:51:17,428 INFO L85 PathProgramCache]: Analyzing trace with hash -108272370, now seen corresponding path program 1 times [2024-11-11 16:51:17,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:51:17,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458604285] [2024-11-11 16:51:17,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:51:17,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:51:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:51:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-11 16:51:17,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:51:17,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458604285] [2024-11-11 16:51:17,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458604285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:51:17,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:51:17,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:51:17,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071520753] [2024-11-11 16:51:17,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:51:17,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:51:17,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:51:17,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:51:17,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:17,808 INFO L87 Difference]: Start difference. First operand 17385 states and 19257 transitions. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:18,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:51:18,690 INFO L93 Difference]: Finished difference Result 37721 states and 41614 transitions. [2024-11-11 16:51:18,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:51:18,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 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 358 [2024-11-11 16:51:18,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:51:18,691 INFO L225 Difference]: With dead ends: 37721 [2024-11-11 16:51:18,692 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 16:51:18,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:51:18,706 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 321 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:51:18,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 57 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:51:18,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 16:51:18,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 16:51:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:18,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 16:51:18,708 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 358 [2024-11-11 16:51:18,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:51:18,708 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 16:51:18,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:51:18,708 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 16:51:18,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 16:51:18,711 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 16:51:18,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 16:51:18,714 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:51:18,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 16:51:23,264 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 16:51:23,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 04:51:23 BoogieIcfgContainer [2024-11-11 16:51:23,277 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 16:51:23,278 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 16:51:23,278 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 16:51:23,278 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 16:51:23,278 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:50:53" (3/4) ... [2024-11-11 16:51:23,280 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 16:51:23,297 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-11 16:51:23,298 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 16:51:23,299 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 16:51:23,300 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 16:51:23,405 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 16:51:23,405 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 16:51:23,405 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 16:51:23,406 INFO L158 Benchmark]: Toolchain (without parser) took 32534.29ms. Allocated memory was 180.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 111.3MB in the beginning and 800.4MB in the end (delta: -689.1MB). Peak memory consumption was 416.1MB. Max. memory is 16.1GB. [2024-11-11 16:51:23,406 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 71.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:51:23,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 639.20ms. Allocated memory is still 180.4MB. Free memory was 111.1MB in the beginning and 118.4MB in the end (delta: -7.3MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2024-11-11 16:51:23,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.61ms. Allocated memory is still 180.4MB. Free memory was 118.4MB in the beginning and 100.9MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-11 16:51:23,407 INFO L158 Benchmark]: Boogie Preprocessor took 120.52ms. Allocated memory is still 180.4MB. Free memory was 100.9MB in the beginning and 75.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-11 16:51:23,407 INFO L158 Benchmark]: RCFGBuilder took 1345.37ms. Allocated memory was 180.4MB in the beginning and 323.0MB in the end (delta: 142.6MB). Free memory was 75.7MB in the beginning and 256.4MB in the end (delta: -180.6MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. [2024-11-11 16:51:23,407 INFO L158 Benchmark]: TraceAbstraction took 30182.62ms. Allocated memory was 323.0MB in the beginning and 1.3GB in the end (delta: 960.5MB). Free memory was 256.4MB in the beginning and 817.1MB in the end (delta: -560.8MB). Peak memory consumption was 815.0MB. Max. memory is 16.1GB. [2024-11-11 16:51:23,408 INFO L158 Benchmark]: Witness Printer took 127.77ms. Allocated memory is still 1.3GB. Free memory was 817.1MB in the beginning and 800.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-11 16:51:23,409 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.15ms. Allocated memory is still 109.1MB. Free memory is still 71.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 639.20ms. Allocated memory is still 180.4MB. Free memory was 111.1MB in the beginning and 118.4MB in the end (delta: -7.3MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.61ms. Allocated memory is still 180.4MB. Free memory was 118.4MB in the beginning and 100.9MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 120.52ms. Allocated memory is still 180.4MB. Free memory was 100.9MB in the beginning and 75.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1345.37ms. Allocated memory was 180.4MB in the beginning and 323.0MB in the end (delta: 142.6MB). Free memory was 75.7MB in the beginning and 256.4MB in the end (delta: -180.6MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. * TraceAbstraction took 30182.62ms. Allocated memory was 323.0MB in the beginning and 1.3GB in the end (delta: 960.5MB). Free memory was 256.4MB in the beginning and 817.1MB in the end (delta: -560.8MB). Peak memory consumption was 815.0MB. Max. memory is 16.1GB. * Witness Printer took 127.77ms. Allocated memory is still 1.3GB. Free memory was 817.1MB in the beginning and 800.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.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: 124]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.6s, OverallIterations: 20, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3861 SdHoareTripleChecker+Valid, 14.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3861 mSDsluCounter, 4633 SdHoareTripleChecker+Invalid, 12.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 548 mSDsCounter, 2006 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14278 IncrementalHoareTripleChecker+Invalid, 16284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2006 mSolverCounterUnsat, 4085 mSDtfsCounter, 14278 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 580 GetRequests, 547 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19063occurred in iteration=17, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 19275 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 5154 NumberOfCodeBlocks, 5154 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 5132 ConstructedInterpolants, 0 QuantifiedInterpolants, 14069 SizeOfPredicates, 0 NumberOfNonLiveVariables, 741 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 3453/3514 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: 1044]: Loop Invariant Derived loop invariant: (((((((((((((((((((((long long) a23 + 43) <= 0) && (a29 <= 384312)) && (a4 == 0)) && (a25 <= 9)) || (((a25 == 11) && (a29 <= 599999)) && (a4 == 1))) || (((a4 == 0) && (a25 <= 10)) && (a29 <= 220))) || (((a25 == 13) && (a29 <= 384312)) && (a4 == 1))) || (((a29 <= 384312) && (a4 == 1)) && (a25 <= 9))) || (((a29 <= 244) && (a25 <= 10)) && (a4 == 1))) || (((a29 <= 275) && (a25 == 12)) && (a4 == 0))) || ((((a25 == 13) && (a4 == 0)) && (((long long) 35913 + a29) <= 0)) && (a23 <= 137))) || ((((307 <= a23) && (a25 <= 10)) && (a29 <= 599999)) && (a4 == 1))) || (((a25 == 12) && (a29 <= 599999)) && (a4 == 1))) || ((((a25 <= 10) && (a29 <= 599999)) && (381712 <= a29)) && (a4 == 1))) || ((a29 <= 599999) && ((((((long long) a23 + 43) <= 0) && (a29 <= 275)) && (a4 == 1)) || (((((long long) a23 + 43) <= 0) && (a25 <= 10)) && (a4 == 1))))) || (((a25 == 11) && (a4 == 1)) && (a23 <= 137))) || ((((a25 == 12) && (a4 == 0)) && (a29 <= 599999)) && (a23 <= 137))) || (((a4 == 0) && (a25 == 11)) && (a29 <= 599999))) || ((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a29 <= 275)) && (a4 == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-11 16:51:23,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE