./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 940f009ebef4e6f688860c69fe317a06471b0d96e24220f1e9007ff15bc7124f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 20:19:47,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 20:19:47,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 20:19:47,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 20:19:47,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 20:19:47,961 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 20:19:47,962 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 20:19:47,962 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 20:19:47,963 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 20:19:47,963 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 20:19:47,963 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 20:19:47,964 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 20:19:47,964 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 20:19:47,964 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 20:19:47,965 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 20:19:47,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 20:19:47,966 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 20:19:47,969 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 20:19:47,969 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 20:19:47,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 20:19:47,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 20:19:47,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 20:19:47,970 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 20:19:47,970 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 20:19:47,971 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 20:19:47,971 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 20:19:47,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 20:19:47,971 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 20:19:47,971 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 20:19:47,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 20:19:47,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 20:19:47,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 20:19:47,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 20:19:47,972 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 20:19:47,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 20:19:47,973 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 20:19:47,974 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 20:19:47,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 20:19:47,975 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 20:19:47,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 20:19:47,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 20:19:47,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 20:19:47,976 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 -> 940f009ebef4e6f688860c69fe317a06471b0d96e24220f1e9007ff15bc7124f [2024-10-23 20:19:48,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 20:19:48,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 20:19:48,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 20:19:48,251 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 20:19:48,251 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 20:19:48,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label02.c [2024-10-23 20:19:49,545 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 20:19:49,861 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 20:19:49,861 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label02.c [2024-10-23 20:19:49,879 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5c23eb9a/6eec9c683fd640b3a21f48a6c468142f/FLAGfe256bdc1 [2024-10-23 20:19:49,894 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5c23eb9a/6eec9c683fd640b3a21f48a6c468142f [2024-10-23 20:19:49,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 20:19:49,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 20:19:49,901 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 20:19:49,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 20:19:49,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 20:19:49,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:19:49" (1/1) ... [2024-10-23 20:19:49,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba12b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:49, skipping insertion in model container [2024-10-23 20:19:49,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:19:49" (1/1) ... [2024-10-23 20:19:49,956 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 20:19:50,390 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label02.c[61770,61783] [2024-10-23 20:19:50,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 20:19:50,428 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 20:19:50,607 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label02.c[61770,61783] [2024-10-23 20:19:50,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 20:19:50,627 INFO L204 MainTranslator]: Completed translation [2024-10-23 20:19:50,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:50 WrapperNode [2024-10-23 20:19:50,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 20:19:50,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 20:19:50,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 20:19:50,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 20:19:50,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:50" (1/1) ... [2024-10-23 20:19:50,661 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:50" (1/1) ... [2024-10-23 20:19:50,731 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-10-23 20:19:50,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 20:19:50,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 20:19:50,732 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 20:19:50,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 20:19:50,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:50" (1/1) ... [2024-10-23 20:19:50,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:50" (1/1) ... [2024-10-23 20:19:50,749 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:50" (1/1) ... [2024-10-23 20:19:50,776 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-23 20:19:50,776 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:50" (1/1) ... [2024-10-23 20:19:50,776 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:50" (1/1) ... [2024-10-23 20:19:50,815 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:50" (1/1) ... [2024-10-23 20:19:50,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:50" (1/1) ... [2024-10-23 20:19:50,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:50" (1/1) ... [2024-10-23 20:19:50,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:50" (1/1) ... [2024-10-23 20:19:50,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 20:19:50,855 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 20:19:50,855 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 20:19:50,855 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 20:19:50,855 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:50" (1/1) ... [2024-10-23 20:19:50,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 20:19:50,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:19:50,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 20:19:50,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 20:19:50,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 20:19:50,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 20:19:50,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 20:19:50,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 20:19:50,998 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 20:19:51,000 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 20:19:52,408 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-23 20:19:52,411 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 20:19:52,469 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 20:19:52,471 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 20:19:52,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:19:52 BoogieIcfgContainer [2024-10-23 20:19:52,472 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 20:19:52,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 20:19:52,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 20:19:52,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 20:19:52,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:19:49" (1/3) ... [2024-10-23 20:19:52,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc628f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:19:52, skipping insertion in model container [2024-10-23 20:19:52,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:50" (2/3) ... [2024-10-23 20:19:52,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc628f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:19:52, skipping insertion in model container [2024-10-23 20:19:52,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:19:52" (3/3) ... [2024-10-23 20:19:52,480 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label02.c [2024-10-23 20:19:52,496 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 20:19:52,497 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 20:19:52,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 20:19:52,562 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;@5482c483, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 20:19:52,562 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 20:19:52,569 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:52,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-23 20:19:52,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:19:52,586 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:19:52,586 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:19:52,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:19:52,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2056920178, now seen corresponding path program 1 times [2024-10-23 20:19:52,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:19:52,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594031355] [2024-10-23 20:19:52,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:19:52,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:19:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:19:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:19:53,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:19:53,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594031355] [2024-10-23 20:19:53,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594031355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:19:53,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:19:53,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:19:53,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796609473] [2024-10-23 20:19:53,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:19:53,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 20:19:53,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:19:53,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 20:19:53,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 20:19:53,071 INFO L87 Difference]: Start difference. First operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 101.5) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:53,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:19:53,124 INFO L93 Difference]: Finished difference Result 479 states and 913 transitions. [2024-10-23 20:19:53,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 20:19:53,126 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 101.5) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 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 203 [2024-10-23 20:19:53,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:19:53,138 INFO L225 Difference]: With dead ends: 479 [2024-10-23 20:19:53,138 INFO L226 Difference]: Without dead ends: 238 [2024-10-23 20:19:53,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 20:19:53,146 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 20:19:53,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 20:19:53,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-23 20:19:53,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-23 20:19:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:53,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2024-10-23 20:19:53,201 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 203 [2024-10-23 20:19:53,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:19:53,202 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2024-10-23 20:19:53,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 101.5) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2024-10-23 20:19:53,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-23 20:19:53,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:19:53,207 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:19:53,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 20:19:53,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:19:53,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:19:53,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1743670992, now seen corresponding path program 1 times [2024-10-23 20:19:53,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:19:53,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640147771] [2024-10-23 20:19:53,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:19:53,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:19:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:19:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:19:53,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:19:53,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640147771] [2024-10-23 20:19:53,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640147771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:19:53,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:19:53,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:19:53,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331799053] [2024-10-23 20:19:53,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:19:53,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:19:53,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:19:53,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:19:53,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:19:53,715 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:54,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:19:54,515 INFO L93 Difference]: Finished difference Result 696 states and 1149 transitions. [2024-10-23 20:19:54,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:19:54,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 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 203 [2024-10-23 20:19:54,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:19:54,522 INFO L225 Difference]: With dead ends: 696 [2024-10-23 20:19:54,523 INFO L226 Difference]: Without dead ends: 459 [2024-10-23 20:19:54,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:19:54,524 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 60 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-23 20:19:54,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 137 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-23 20:19:54,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-10-23 20:19:54,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 458. [2024-10-23 20:19:54,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 1.5514223194748358) internal successors, (709), 457 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:54,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 709 transitions. [2024-10-23 20:19:54,552 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 709 transitions. Word has length 203 [2024-10-23 20:19:54,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:19:54,553 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 709 transitions. [2024-10-23 20:19:54,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:54,553 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 709 transitions. [2024-10-23 20:19:54,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-23 20:19:54,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:19:54,556 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:19:54,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 20:19:54,557 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:19:54,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:19:54,557 INFO L85 PathProgramCache]: Analyzing trace with hash -222168540, now seen corresponding path program 1 times [2024-10-23 20:19:54,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:19:54,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115462576] [2024-10-23 20:19:54,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:19:54,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:19:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:19:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:19:54,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:19:54,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115462576] [2024-10-23 20:19:54,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115462576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:19:54,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:19:54,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:19:54,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234507666] [2024-10-23 20:19:54,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:19:54,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:19:54,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:19:54,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:19:54,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:19:54,846 INFO L87 Difference]: Start difference. First operand 458 states and 709 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:55,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:19:55,528 INFO L93 Difference]: Finished difference Result 1339 states and 2080 transitions. [2024-10-23 20:19:55,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:19:55,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2024-10-23 20:19:55,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:19:55,531 INFO L225 Difference]: With dead ends: 1339 [2024-10-23 20:19:55,531 INFO L226 Difference]: Without dead ends: 882 [2024-10-23 20:19:55,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:19:55,537 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 249 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:19:55,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 178 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:19:55,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-23 20:19:55,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 879. [2024-10-23 20:19:55,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 1.468109339407745) internal successors, (1289), 878 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:55,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1289 transitions. [2024-10-23 20:19:55,570 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1289 transitions. Word has length 208 [2024-10-23 20:19:55,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:19:55,570 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1289 transitions. [2024-10-23 20:19:55,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:55,571 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1289 transitions. [2024-10-23 20:19:55,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-23 20:19:55,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:19:55,575 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:19:55,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 20:19:55,575 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:19:55,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:19:55,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1429944303, now seen corresponding path program 1 times [2024-10-23 20:19:55,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:19:55,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943737242] [2024-10-23 20:19:55,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:19:55,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:19:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:19:55,690 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:19:55,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:19:55,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943737242] [2024-10-23 20:19:55,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943737242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:19:55,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:19:55,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:19:55,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065945401] [2024-10-23 20:19:55,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:19:55,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:19:55,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:19:55,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:19:55,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:19:55,694 INFO L87 Difference]: Start difference. First operand 879 states and 1289 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 2 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-10-23 20:19:56,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:19:56,422 INFO L93 Difference]: Finished difference Result 2593 states and 3818 transitions. [2024-10-23 20:19:56,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:19:56,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 2 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 211 [2024-10-23 20:19:56,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:19:56,427 INFO L225 Difference]: With dead ends: 2593 [2024-10-23 20:19:56,427 INFO L226 Difference]: Without dead ends: 1715 [2024-10-23 20:19:56,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:19:56,430 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 20:19:56,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 90 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 20:19:56,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2024-10-23 20:19:56,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1695. [2024-10-23 20:19:56,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1694 states have (on average 1.43801652892562) internal successors, (2436), 1694 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2436 transitions. [2024-10-23 20:19:56,455 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2436 transitions. Word has length 211 [2024-10-23 20:19:56,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:19:56,455 INFO L471 AbstractCegarLoop]: Abstraction has 1695 states and 2436 transitions. [2024-10-23 20:19:56,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 2 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-10-23 20:19:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2436 transitions. [2024-10-23 20:19:56,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-23 20:19:56,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:19:56,461 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:19:56,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 20:19:56,461 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:19:56,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:19:56,462 INFO L85 PathProgramCache]: Analyzing trace with hash -435953514, now seen corresponding path program 1 times [2024-10-23 20:19:56,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:19:56,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536662920] [2024-10-23 20:19:56,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:19:56,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:19:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:19:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 20:19:56,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:19:56,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536662920] [2024-10-23 20:19:56,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536662920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:19:56,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:19:56,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:19:56,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853335599] [2024-10-23 20:19:56,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:19:56,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:19:56,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:19:56,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:19:56,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:19:56,668 INFO L87 Difference]: Start difference. First operand 1695 states and 2436 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:57,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:19:57,377 INFO L93 Difference]: Finished difference Result 5016 states and 7217 transitions. [2024-10-23 20:19:57,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:19:57,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 223 [2024-10-23 20:19:57,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:19:57,387 INFO L225 Difference]: With dead ends: 5016 [2024-10-23 20:19:57,387 INFO L226 Difference]: Without dead ends: 3322 [2024-10-23 20:19:57,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:19:57,392 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 235 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 20:19:57,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 408 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 20:19:57,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2024-10-23 20:19:57,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 3319. [2024-10-23 20:19:57,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3319 states, 3318 states have (on average 1.2848101265822784) internal successors, (4263), 3318 states have internal predecessors, (4263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:57,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 4263 transitions. [2024-10-23 20:19:57,440 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 4263 transitions. Word has length 223 [2024-10-23 20:19:57,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:19:57,440 INFO L471 AbstractCegarLoop]: Abstraction has 3319 states and 4263 transitions. [2024-10-23 20:19:57,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:57,441 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 4263 transitions. [2024-10-23 20:19:57,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-23 20:19:57,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:19:57,447 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:19:57,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 20:19:57,447 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:19:57,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:19:57,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1911804994, now seen corresponding path program 1 times [2024-10-23 20:19:57,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:19:57,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798412948] [2024-10-23 20:19:57,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:19:57,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:19:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:19:57,709 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 20:19:57,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:19:57,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798412948] [2024-10-23 20:19:57,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798412948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:19:57,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:19:57,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:19:57,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96250944] [2024-10-23 20:19:57,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:19:57,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:19:57,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:19:57,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:19:57,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:19:57,711 INFO L87 Difference]: Start difference. First operand 3319 states and 4263 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:58,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:19:58,532 INFO L93 Difference]: Finished difference Result 9899 states and 12716 transitions. [2024-10-23 20:19:58,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:19:58,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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-10-23 20:19:58,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:19:58,553 INFO L225 Difference]: With dead ends: 9899 [2024-10-23 20:19:58,554 INFO L226 Difference]: Without dead ends: 6581 [2024-10-23 20:19:58,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:19:58,561 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 202 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 20:19:58,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 415 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 20:19:58,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6581 states. [2024-10-23 20:19:58,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6581 to 6576. [2024-10-23 20:19:58,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6576 states, 6575 states have (on average 1.224486692015209) internal successors, (8051), 6575 states have internal predecessors, (8051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:58,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6576 states to 6576 states and 8051 transitions. [2024-10-23 20:19:58,667 INFO L78 Accepts]: Start accepts. Automaton has 6576 states and 8051 transitions. Word has length 238 [2024-10-23 20:19:58,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:19:58,667 INFO L471 AbstractCegarLoop]: Abstraction has 6576 states and 8051 transitions. [2024-10-23 20:19:58,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 6576 states and 8051 transitions. [2024-10-23 20:19:58,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-10-23 20:19:58,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:19:58,685 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:19:58,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 20:19:58,685 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:19:58,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:19:58,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2109491811, now seen corresponding path program 1 times [2024-10-23 20:19:58,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:19:58,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707239493] [2024-10-23 20:19:58,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:19:58,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:19:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:19:59,090 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:19:59,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:19:59,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707239493] [2024-10-23 20:19:59,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707239493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:19:59,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:19:59,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:19:59,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001690880] [2024-10-23 20:19:59,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:19:59,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:19:59,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:19:59,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:19:59,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:19:59,093 INFO L87 Difference]: Start difference. First operand 6576 states and 8051 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 2 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:59,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:19:59,807 INFO L93 Difference]: Finished difference Result 16026 states and 19626 transitions. [2024-10-23 20:19:59,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:19:59,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 2 states have internal predecessors, (244), 0 states have call successors, (0), 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 244 [2024-10-23 20:19:59,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:19:59,832 INFO L225 Difference]: With dead ends: 16026 [2024-10-23 20:19:59,832 INFO L226 Difference]: Without dead ends: 9451 [2024-10-23 20:19:59,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:19:59,840 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 197 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:19:59,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 192 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:19:59,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9451 states. [2024-10-23 20:19:59,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9451 to 9438. [2024-10-23 20:19:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9438 states, 9437 states have (on average 1.2135212461587368) internal successors, (11452), 9437 states have internal predecessors, (11452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:59,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 11452 transitions. [2024-10-23 20:19:59,978 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 11452 transitions. Word has length 244 [2024-10-23 20:19:59,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:19:59,978 INFO L471 AbstractCegarLoop]: Abstraction has 9438 states and 11452 transitions. [2024-10-23 20:19:59,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 2 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:59,979 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 11452 transitions. [2024-10-23 20:19:59,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-23 20:19:59,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:19:59,993 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:19:59,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-23 20:19:59,993 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:19:59,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:19:59,994 INFO L85 PathProgramCache]: Analyzing trace with hash -439354604, now seen corresponding path program 1 times [2024-10-23 20:19:59,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:19:59,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888142617] [2024-10-23 20:19:59,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:19:59,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:00,473 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:20:00,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:00,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888142617] [2024-10-23 20:20:00,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888142617] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:20:00,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194798993] [2024-10-23 20:20:00,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:00,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:20:00,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:20:00,477 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 20:20:00,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-23 20:20:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:00,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:20:00,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:20:00,933 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 20:20:00,934 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:20:00,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194798993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:00,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:20:00,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-23 20:20:00,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296986526] [2024-10-23 20:20:00,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:00,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:00,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:00,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:00,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:20:00,936 INFO L87 Difference]: Start difference. First operand 9438 states and 11452 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:20:01,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:01,537 INFO L93 Difference]: Finished difference Result 18878 states and 22908 transitions. [2024-10-23 20:20:01,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:01,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 251 [2024-10-23 20:20:01,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:01,559 INFO L225 Difference]: With dead ends: 18878 [2024-10-23 20:20:01,559 INFO L226 Difference]: Without dead ends: 9441 [2024-10-23 20:20:01,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:20:01,569 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 73 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:01,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 96 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 20:20:01,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9441 states. [2024-10-23 20:20:01,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9441 to 9438. [2024-10-23 20:20:01,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9438 states, 9437 states have (on average 1.2056797711137013) internal successors, (11378), 9437 states have internal predecessors, (11378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:20:01,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9438 states to 9438 states and 11378 transitions. [2024-10-23 20:20:01,685 INFO L78 Accepts]: Start accepts. Automaton has 9438 states and 11378 transitions. Word has length 251 [2024-10-23 20:20:01,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:01,687 INFO L471 AbstractCegarLoop]: Abstraction has 9438 states and 11378 transitions. [2024-10-23 20:20:01,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:20:01,687 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states and 11378 transitions. [2024-10-23 20:20:01,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2024-10-23 20:20:01,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:01,709 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:20:01,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-23 20:20:01,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:20:01,910 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:01,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:01,911 INFO L85 PathProgramCache]: Analyzing trace with hash -904501298, now seen corresponding path program 1 times [2024-10-23 20:20:01,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:01,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58853749] [2024-10-23 20:20:01,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:01,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:02,232 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-23 20:20:02,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:02,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58853749] [2024-10-23 20:20:02,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58853749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:02,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:02,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:20:02,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182367909] [2024-10-23 20:20:02,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:02,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:02,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:02,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:02,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:02,234 INFO L87 Difference]: Start difference. First operand 9438 states and 11378 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:20:02,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:02,919 INFO L93 Difference]: Finished difference Result 22140 states and 26798 transitions. [2024-10-23 20:20:02,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:02,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 305 [2024-10-23 20:20:02,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:02,940 INFO L225 Difference]: With dead ends: 22140 [2024-10-23 20:20:02,940 INFO L226 Difference]: Without dead ends: 12703 [2024-10-23 20:20:02,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:02,950 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 214 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:02,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 410 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:20:02,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12703 states. [2024-10-23 20:20:03,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12703 to 11872. [2024-10-23 20:20:03,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11872 states, 11871 states have (on average 1.1861679723696403) internal successors, (14081), 11871 states have internal predecessors, (14081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:20:03,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11872 states to 11872 states and 14081 transitions. [2024-10-23 20:20:03,099 INFO L78 Accepts]: Start accepts. Automaton has 11872 states and 14081 transitions. Word has length 305 [2024-10-23 20:20:03,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:03,100 INFO L471 AbstractCegarLoop]: Abstraction has 11872 states and 14081 transitions. [2024-10-23 20:20:03,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:20:03,101 INFO L276 IsEmpty]: Start isEmpty. Operand 11872 states and 14081 transitions. [2024-10-23 20:20:03,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-10-23 20:20:03,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:03,119 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-10-23 20:20:03,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-23 20:20:03,119 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:03,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:03,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1534897414, now seen corresponding path program 1 times [2024-10-23 20:20:03,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:03,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116123904] [2024-10-23 20:20:03,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:03,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:03,576 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 94 proven. 6 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-23 20:20:03,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:03,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116123904] [2024-10-23 20:20:03,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116123904] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:20:03,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542200043] [2024-10-23 20:20:03,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:03,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:20:03,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:20:03,579 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 20:20:03,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-23 20:20:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:03,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:20:03,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:20:03,804 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 20:20:03,805 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:20:03,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542200043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:03,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:20:03,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-23 20:20:03,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246487969] [2024-10-23 20:20:03,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:03,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:03,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:03,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:03,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:20:03,808 INFO L87 Difference]: Start difference. First operand 11872 states and 14081 transitions. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:20:04,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:04,497 INFO L93 Difference]: Finished difference Result 28415 states and 34173 transitions. [2024-10-23 20:20:04,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:04,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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 312 [2024-10-23 20:20:04,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:04,524 INFO L225 Difference]: With dead ends: 28415 [2024-10-23 20:20:04,525 INFO L226 Difference]: Without dead ends: 16747 [2024-10-23 20:20:04,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:20:04,537 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 185 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:04,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 164 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:20:04,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16747 states. [2024-10-23 20:20:04,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16747 to 16338. [2024-10-23 20:20:04,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16338 states, 16337 states have (on average 1.1619024300667198) internal successors, (18982), 16337 states have internal predecessors, (18982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:20:04,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16338 states to 16338 states and 18982 transitions. [2024-10-23 20:20:04,788 INFO L78 Accepts]: Start accepts. Automaton has 16338 states and 18982 transitions. Word has length 312 [2024-10-23 20:20:04,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:04,788 INFO L471 AbstractCegarLoop]: Abstraction has 16338 states and 18982 transitions. [2024-10-23 20:20:04,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:20:04,788 INFO L276 IsEmpty]: Start isEmpty. Operand 16338 states and 18982 transitions. [2024-10-23 20:20:04,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2024-10-23 20:20:04,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:04,806 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 20:20:04,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-23 20:20:05,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-23 20:20:05,007 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:05,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:05,008 INFO L85 PathProgramCache]: Analyzing trace with hash 805815337, now seen corresponding path program 1 times [2024-10-23 20:20:05,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:05,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187021566] [2024-10-23 20:20:05,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:05,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:05,308 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-10-23 20:20:05,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:05,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187021566] [2024-10-23 20:20:05,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187021566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:05,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:05,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:20:05,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803130541] [2024-10-23 20:20:05,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:05,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 20:20:05,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:05,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 20:20:05,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 20:20:05,310 INFO L87 Difference]: Start difference. First operand 16338 states and 18982 transitions. Second operand has 4 states, 4 states have (on average 62.0) 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-10-23 20:20:06,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:06,210 INFO L93 Difference]: Finished difference Result 32297 states and 37577 transitions. [2024-10-23 20:20:06,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 20:20:06,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.0) 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 321 [2024-10-23 20:20:06,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:06,230 INFO L225 Difference]: With dead ends: 32297 [2024-10-23 20:20:06,230 INFO L226 Difference]: Without dead ends: 16163 [2024-10-23 20:20:06,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 20:20:06,245 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 405 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:06,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 170 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-23 20:20:06,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16163 states. [2024-10-23 20:20:06,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16163 to 15118. [2024-10-23 20:20:06,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15118 states, 15117 states have (on average 1.164781371965337) internal successors, (17608), 15117 states have internal predecessors, (17608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:20:06,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15118 states to 15118 states and 17608 transitions. [2024-10-23 20:20:06,410 INFO L78 Accepts]: Start accepts. Automaton has 15118 states and 17608 transitions. Word has length 321 [2024-10-23 20:20:06,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:06,411 INFO L471 AbstractCegarLoop]: Abstraction has 15118 states and 17608 transitions. [2024-10-23 20:20:06,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) 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-10-23 20:20:06,411 INFO L276 IsEmpty]: Start isEmpty. Operand 15118 states and 17608 transitions. [2024-10-23 20:20:06,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-10-23 20:20:06,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:06,428 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 20:20:06,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-23 20:20:06,428 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:06,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:06,429 INFO L85 PathProgramCache]: Analyzing trace with hash 148603672, now seen corresponding path program 1 times [2024-10-23 20:20:06,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:06,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056772412] [2024-10-23 20:20:06,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:06,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:06,780 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 93 proven. 6 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-23 20:20:06,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:06,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056772412] [2024-10-23 20:20:06,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056772412] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:20:06,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362674755] [2024-10-23 20:20:06,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:06,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:20:06,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:20:06,782 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 20:20:06,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-23 20:20:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:06,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 20:20:06,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:20:07,051 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 180 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 20:20:07,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 20:20:07,137 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 180 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 20:20:07,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362674755] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 20:20:07,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-23 20:20:07,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 6 [2024-10-23 20:20:07,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781278069] [2024-10-23 20:20:07,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-23 20:20:07,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-23 20:20:07,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:07,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-23 20:20:07,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-23 20:20:07,139 INFO L87 Difference]: Start difference. First operand 15118 states and 17608 transitions. Second operand has 6 states, 6 states have (on average 60.5) internal successors, (363), 6 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:20:10,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:10,151 INFO L93 Difference]: Finished difference Result 66145 states and 76827 transitions. [2024-10-23 20:20:10,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-23 20:20:10,152 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 60.5) internal successors, (363), 6 states have internal predecessors, (363), 0 states have call successors, (0), 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 328 [2024-10-23 20:20:10,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:10,221 INFO L225 Difference]: With dead ends: 66145 [2024-10-23 20:20:10,222 INFO L226 Difference]: Without dead ends: 51229 [2024-10-23 20:20:10,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 660 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-23 20:20:10,242 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 2879 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 3967 mSolverCounterSat, 668 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2879 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 4635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 668 IncrementalHoareTripleChecker+Valid, 3967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:10,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2879 Valid, 419 Invalid, 4635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [668 Valid, 3967 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-23 20:20:10,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51229 states. [2024-10-23 20:20:10,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51229 to 50784. [2024-10-23 20:20:10,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50784 states, 50783 states have (on average 1.125534135439025) internal successors, (57158), 50783 states have internal predecessors, (57158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:20:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50784 states to 50784 states and 57158 transitions. [2024-10-23 20:20:10,866 INFO L78 Accepts]: Start accepts. Automaton has 50784 states and 57158 transitions. Word has length 328 [2024-10-23 20:20:10,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:10,866 INFO L471 AbstractCegarLoop]: Abstraction has 50784 states and 57158 transitions. [2024-10-23 20:20:10,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 60.5) internal successors, (363), 6 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:20:10,867 INFO L276 IsEmpty]: Start isEmpty. Operand 50784 states and 57158 transitions. [2024-10-23 20:20:10,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-10-23 20:20:10,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:10,901 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 20:20:10,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-23 20:20:11,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:20:11,103 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:11,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:11,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2095067, now seen corresponding path program 1 times [2024-10-23 20:20:11,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:11,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104312416] [2024-10-23 20:20:11,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:11,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:20:11,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:11,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104312416] [2024-10-23 20:20:11,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104312416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:11,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:11,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:20:11,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253131951] [2024-10-23 20:20:11,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:11,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:11,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:11,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:11,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:11,552 INFO L87 Difference]: Start difference. First operand 50784 states and 57158 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 2 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:20:12,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:12,446 INFO L93 Difference]: Finished difference Result 117862 states and 132840 transitions. [2024-10-23 20:20:12,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:12,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 2 states have internal predecessors, (329), 0 states have call successors, (0), 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 329 [2024-10-23 20:20:12,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:12,534 INFO L225 Difference]: With dead ends: 117862 [2024-10-23 20:20:12,534 INFO L226 Difference]: Without dead ends: 67282 [2024-10-23 20:20:12,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:12,568 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 101 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:12,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 185 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 20:20:12,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67282 states. [2024-10-23 20:20:13,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67282 to 67277. [2024-10-23 20:20:13,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67277 states, 67276 states have (on average 1.124606100243772) internal successors, (75659), 67276 states have internal predecessors, (75659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:20:13,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67277 states to 67277 states and 75659 transitions. [2024-10-23 20:20:13,348 INFO L78 Accepts]: Start accepts. Automaton has 67277 states and 75659 transitions. Word has length 329 [2024-10-23 20:20:13,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:13,349 INFO L471 AbstractCegarLoop]: Abstraction has 67277 states and 75659 transitions. [2024-10-23 20:20:13,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 2 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:20:13,349 INFO L276 IsEmpty]: Start isEmpty. Operand 67277 states and 75659 transitions. [2024-10-23 20:20:13,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-10-23 20:20:13,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:13,387 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 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] [2024-10-23 20:20:13,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-23 20:20:13,388 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:13,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:13,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1942399030, now seen corresponding path program 1 times [2024-10-23 20:20:13,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:13,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114629526] [2024-10-23 20:20:13,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:13,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:14,957 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 130 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:20:14,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:14,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114629526] [2024-10-23 20:20:14,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114629526] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:20:14,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38248481] [2024-10-23 20:20:14,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:14,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:20:14,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:20:14,961 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 20:20:14,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-23 20:20:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:15,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:20:15,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:20:15,318 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 20:20:15,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:20:15,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38248481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:15,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:20:15,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-23 20:20:15,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198112707] [2024-10-23 20:20:15,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:15,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:15,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:15,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:15,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-23 20:20:15,322 INFO L87 Difference]: Start difference. First operand 67277 states and 75659 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:20:16,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:16,242 INFO L93 Difference]: Finished difference Result 155755 states and 176006 transitions. [2024-10-23 20:20:16,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:16,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 336 [2024-10-23 20:20:16,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:16,244 INFO L225 Difference]: With dead ends: 155755 [2024-10-23 20:20:16,244 INFO L226 Difference]: Without dead ends: 0 [2024-10-23 20:20:16,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-23 20:20:16,299 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 66 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:16,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 151 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:20:16,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-23 20:20:16,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-23 20:20:16,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:20:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-23 20:20:16,300 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 336 [2024-10-23 20:20:16,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:16,300 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-23 20:20:16,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:20:16,300 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-23 20:20:16,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-23 20:20:16,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 20:20:16,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-23 20:20:16,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:20:16,506 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:20:16,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-23 20:20:24,792 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 20:20:24,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:20:24 BoogieIcfgContainer [2024-10-23 20:20:24,805 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 20:20:24,805 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 20:20:24,809 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 20:20:24,809 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 20:20:24,810 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:19:52" (3/4) ... [2024-10-23 20:20:24,811 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-23 20:20:24,830 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-23 20:20:24,832 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-23 20:20:24,833 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-23 20:20:24,835 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-23 20:20:25,008 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 20:20:25,009 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-23 20:20:25,009 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 20:20:25,010 INFO L158 Benchmark]: Toolchain (without parser) took 35111.95ms. Allocated memory was 172.0MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 138.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-10-23 20:20:25,010 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 130.0MB. Free memory was 92.0MB in the beginning and 91.9MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 20:20:25,010 INFO L158 Benchmark]: CACSL2BoogieTranslator took 727.05ms. Allocated memory is still 172.0MB. Free memory was 137.5MB in the beginning and 122.0MB in the end (delta: 15.4MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. [2024-10-23 20:20:25,011 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.37ms. Allocated memory is still 172.0MB. Free memory was 122.0MB in the beginning and 107.4MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-23 20:20:25,011 INFO L158 Benchmark]: Boogie Preprocessor took 122.02ms. Allocated memory is still 172.0MB. Free memory was 107.4MB in the beginning and 94.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-23 20:20:25,012 INFO L158 Benchmark]: RCFGBuilder took 1617.27ms. Allocated memory was 172.0MB in the beginning and 257.9MB in the end (delta: 86.0MB). Free memory was 94.8MB in the beginning and 132.3MB in the end (delta: -37.6MB). Peak memory consumption was 123.0MB. Max. memory is 16.1GB. [2024-10-23 20:20:25,012 INFO L158 Benchmark]: TraceAbstraction took 32331.66ms. Allocated memory was 257.9MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 131.3MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-10-23 20:20:25,012 INFO L158 Benchmark]: Witness Printer took 203.39ms. Allocated memory is still 3.1GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-23 20:20:25,014 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.16ms. Allocated memory is still 130.0MB. Free memory was 92.0MB in the beginning and 91.9MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 727.05ms. Allocated memory is still 172.0MB. Free memory was 137.5MB in the beginning and 122.0MB in the end (delta: 15.4MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.37ms. Allocated memory is still 172.0MB. Free memory was 122.0MB in the beginning and 107.4MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 122.02ms. Allocated memory is still 172.0MB. Free memory was 107.4MB in the beginning and 94.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1617.27ms. Allocated memory was 172.0MB in the beginning and 257.9MB in the end (delta: 86.0MB). Free memory was 94.8MB in the beginning and 132.3MB in the end (delta: -37.6MB). Peak memory consumption was 123.0MB. Max. memory is 16.1GB. * TraceAbstraction took 32331.66ms. Allocated memory was 257.9MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 131.3MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 203.39ms. Allocated memory is still 3.1GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. 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: 1657]: 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, 240 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.0s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5113 SdHoareTripleChecker+Valid, 10.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5113 mSDsluCounter, 3407 SdHoareTripleChecker+Invalid, 8.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 586 mSDsCounter, 2121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11800 IncrementalHoareTripleChecker+Invalid, 13921 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2121 mSolverCounterUnsat, 2821 mSDtfsCounter, 11800 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1601 GetRequests, 1570 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67277occurred in iteration=13, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 2783 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 4939 NumberOfCodeBlocks, 4939 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 5248 ConstructedInterpolants, 0 QuantifiedInterpolants, 11679 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2120 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 1827/1877 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: 1668]: Loop Invariant Derived loop invariant: (((((((((((1 <= a3) && (a11 == 1)) || (((a11 == 1) && (a12 <= 0)) && (a3 == 0))) || (((a7 != 1) && (a11 == 0)) && (a3 == 0))) || (((a6 == 0) && (a11 == 0)) && (a3 == 0))) || ((((a26 == 1) && (a11 == 0)) && (a27 == 1)) && (a3 == 0))) || (((a11 == 1) && (a6 == 0)) && (a3 == 0))) || (((a11 == 1) && (a27 == 1)) && (a3 == 0))) || ((((a26 == 1) && (a12 == 1)) && (a11 == 1)) && (a3 == 0))) || ((((a26 == 1) && (a12 == 1)) && (a11 == 0)) && (a3 == 0))) || ((1 <= a3) && (a11 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-23 20:20:25,041 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