./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_label08.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label08.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cfb40cb555a14fd95bceea51ff65e6513c4cf2d7cc92f4af25db414fd945afd5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:35:44,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:35:44,772 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:35:44,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:35:44,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:35:44,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:35:44,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:35:44,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:35:44,806 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:35:44,807 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:35:44,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:35:44,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:35:44,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:35:44,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:35:44,809 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:35:44,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:35:44,810 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:35:44,810 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:35:44,810 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:35:44,810 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:35:44,810 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:35:44,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:35:44,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:35:44,813 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:35:44,813 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:35:44,813 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:35:44,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:35:44,814 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:35:44,814 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:35:44,814 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:35:44,814 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:35:44,814 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:35:44,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:35:44,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:35:44,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:35:44,815 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:35:44,815 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:35:44,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:35:44,815 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:35:44,815 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:35:44,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:35:44,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:35:44,817 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cfb40cb555a14fd95bceea51ff65e6513c4cf2d7cc92f4af25db414fd945afd5 [2024-10-10 22:35:45,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:35:45,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:35:45,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:35:45,044 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:35:45,045 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:35:45,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label08.c [2024-10-10 22:35:46,354 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:35:46,605 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:35:46,606 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label08.c [2024-10-10 22:35:46,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/77d783dfb/67132a908d63471a93617a5abbef9066/FLAGcecb77879 [2024-10-10 22:35:46,915 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/77d783dfb/67132a908d63471a93617a5abbef9066 [2024-10-10 22:35:46,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:35:46,918 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:35:46,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:35:46,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:35:46,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:35:46,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:35:46" (1/1) ... [2024-10-10 22:35:46,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f7d22a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:46, skipping insertion in model container [2024-10-10 22:35:46,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:35:46" (1/1) ... [2024-10-10 22:35:46,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:35:47,356 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_label08.c[55410,55423] [2024-10-10 22:35:47,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:35:47,401 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:35:47,525 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_label08.c[55410,55423] [2024-10-10 22:35:47,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:35:47,555 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:35:47,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:47 WrapperNode [2024-10-10 22:35:47,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:35:47,557 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:35:47,557 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:35:47,557 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:35:47,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:47" (1/1) ... [2024-10-10 22:35:47,621 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:47" (1/1) ... [2024-10-10 22:35:47,704 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-10-10 22:35:47,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:35:47,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:35:47,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:35:47,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:35:47,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:47" (1/1) ... [2024-10-10 22:35:47,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:47" (1/1) ... [2024-10-10 22:35:47,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:47" (1/1) ... [2024-10-10 22:35:47,770 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 22:35:47,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:47" (1/1) ... [2024-10-10 22:35:47,773 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:47" (1/1) ... [2024-10-10 22:35:47,802 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:47" (1/1) ... [2024-10-10 22:35:47,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:47" (1/1) ... [2024-10-10 22:35:47,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:47" (1/1) ... [2024-10-10 22:35:47,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:47" (1/1) ... [2024-10-10 22:35:47,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:35:47,847 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:35:47,847 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:35:47,848 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:35:47,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:47" (1/1) ... [2024-10-10 22:35:47,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:35:47,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:35:47,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:35:47,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:35:47,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:35:47,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:35:47,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:35:47,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:35:47,992 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:35:47,994 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:35:49,327 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-10 22:35:49,328 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:35:49,366 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:35:49,366 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:35:49,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:35:49 BoogieIcfgContainer [2024-10-10 22:35:49,367 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:35:49,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:35:49,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:35:49,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:35:49,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:35:46" (1/3) ... [2024-10-10 22:35:49,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132bbcfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:35:49, skipping insertion in model container [2024-10-10 22:35:49,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:47" (2/3) ... [2024-10-10 22:35:49,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132bbcfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:35:49, skipping insertion in model container [2024-10-10 22:35:49,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:35:49" (3/3) ... [2024-10-10 22:35:49,373 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label08.c [2024-10-10 22:35:49,386 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:35:49,386 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:35:49,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:35:49,455 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;@1cc910bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:35:49,456 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:35:49,462 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-10 22:35:49,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-10 22:35:49,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:49,474 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] [2024-10-10 22:35:49,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:49,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:49,480 INFO L85 PathProgramCache]: Analyzing trace with hash 508503873, now seen corresponding path program 1 times [2024-10-10 22:35:49,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:49,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302792276] [2024-10-10 22:35:49,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:49,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:50,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:35:50,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:50,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302792276] [2024-10-10 22:35:50,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302792276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:50,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:50,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:35:50,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771032929] [2024-10-10 22:35:50,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:50,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:35:50,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:50,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:35:50,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:35:50,036 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 78.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:50,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:50,078 INFO L93 Difference]: Finished difference Result 479 states and 913 transitions. [2024-10-10 22:35:50,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:35:50,080 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2024-10-10 22:35:50,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:50,088 INFO L225 Difference]: With dead ends: 479 [2024-10-10 22:35:50,089 INFO L226 Difference]: Without dead ends: 238 [2024-10-10 22:35:50,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:35:50,093 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-10 22:35:50,094 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-10 22:35:50,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-10 22:35:50,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-10 22:35:50,136 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-10 22:35:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2024-10-10 22:35:50,144 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 156 [2024-10-10 22:35:50,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:50,145 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2024-10-10 22:35:50,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:50,145 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2024-10-10 22:35:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-10 22:35:50,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:50,147 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] [2024-10-10 22:35:50,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:35:50,148 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:50,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:50,152 INFO L85 PathProgramCache]: Analyzing trace with hash -2020038930, now seen corresponding path program 1 times [2024-10-10 22:35:50,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:50,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211418631] [2024-10-10 22:35:50,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:50,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:50,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:35:50,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:50,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211418631] [2024-10-10 22:35:50,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211418631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:50,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:50,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:35:50,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244644923] [2024-10-10 22:35:50,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:50,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:50,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:50,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:50,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:50,585 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:51,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:51,318 INFO L93 Difference]: Finished difference Result 686 states and 1135 transitions. [2024-10-10 22:35:51,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:51,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2024-10-10 22:35:51,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:51,323 INFO L225 Difference]: With dead ends: 686 [2024-10-10 22:35:51,323 INFO L226 Difference]: Without dead ends: 449 [2024-10-10 22:35:51,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:51,325 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 121 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:51,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 90 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:35:51,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-10-10 22:35:51,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 447. [2024-10-10 22:35:51,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.6233183856502242) internal successors, (724), 446 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:51,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 724 transitions. [2024-10-10 22:35:51,349 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 724 transitions. Word has length 156 [2024-10-10 22:35:51,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:51,350 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 724 transitions. [2024-10-10 22:35:51,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:51,350 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 724 transitions. [2024-10-10 22:35:51,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-10 22:35:51,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:51,357 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] [2024-10-10 22:35:51,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:35:51,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:51,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:51,359 INFO L85 PathProgramCache]: Analyzing trace with hash 860051832, now seen corresponding path program 1 times [2024-10-10 22:35:51,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:51,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162043454] [2024-10-10 22:35:51,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:51,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:51,542 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-10 22:35:51,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:51,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162043454] [2024-10-10 22:35:51,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162043454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:51,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:51,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:35:51,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795255544] [2024-10-10 22:35:51,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:51,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:51,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:51,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:51,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:51,547 INFO L87 Difference]: Start difference. First operand 447 states and 724 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:52,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:52,171 INFO L93 Difference]: Finished difference Result 1317 states and 2138 transitions. [2024-10-10 22:35:52,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:52,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-10-10 22:35:52,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:52,175 INFO L225 Difference]: With dead ends: 1317 [2024-10-10 22:35:52,175 INFO L226 Difference]: Without dead ends: 871 [2024-10-10 22:35:52,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:52,177 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 251 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:52,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 156 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:35:52,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-10-10 22:35:52,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 867. [2024-10-10 22:35:52,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 866 states have (on average 1.5277136258660509) internal successors, (1323), 866 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1323 transitions. [2024-10-10 22:35:52,200 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1323 transitions. Word has length 161 [2024-10-10 22:35:52,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:52,200 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1323 transitions. [2024-10-10 22:35:52,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1323 transitions. [2024-10-10 22:35:52,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-10 22:35:52,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:52,202 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] [2024-10-10 22:35:52,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:35:52,202 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:52,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:52,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1284347567, now seen corresponding path program 1 times [2024-10-10 22:35:52,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:52,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011845783] [2024-10-10 22:35:52,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:52,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:52,311 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-10 22:35:52,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:52,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011845783] [2024-10-10 22:35:52,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011845783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:52,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:52,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:35:52,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825770262] [2024-10-10 22:35:52,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:52,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:52,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:52,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:52,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:52,313 INFO L87 Difference]: Start difference. First operand 867 states and 1323 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:52,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:52,995 INFO L93 Difference]: Finished difference Result 2565 states and 3930 transitions. [2024-10-10 22:35:52,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:52,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2024-10-10 22:35:52,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:53,001 INFO L225 Difference]: With dead ends: 2565 [2024-10-10 22:35:53,001 INFO L226 Difference]: Without dead ends: 1699 [2024-10-10 22:35:53,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:53,003 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 88 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-10 22:35:53,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 88 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:35:53,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2024-10-10 22:35:53,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1683. [2024-10-10 22:35:53,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1682 states have (on average 1.4982164090368608) internal successors, (2520), 1682 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:53,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2520 transitions. [2024-10-10 22:35:53,040 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2520 transitions. Word has length 164 [2024-10-10 22:35:53,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:53,040 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2520 transitions. [2024-10-10 22:35:53,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:53,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2520 transitions. [2024-10-10 22:35:53,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-10 22:35:53,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:53,043 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:35:53,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:35:53,043 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:53,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:53,045 INFO L85 PathProgramCache]: Analyzing trace with hash -679164012, now seen corresponding path program 1 times [2024-10-10 22:35:53,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:53,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455617547] [2024-10-10 22:35:53,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:53,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:53,273 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:35:53,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:53,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455617547] [2024-10-10 22:35:53,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455617547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:53,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:53,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:35:53,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034168899] [2024-10-10 22:35:53,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:53,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:53,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:53,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:53,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:53,276 INFO L87 Difference]: Start difference. First operand 1683 states and 2520 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:54,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:54,039 INFO L93 Difference]: Finished difference Result 4187 states and 6246 transitions. [2024-10-10 22:35:54,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:54,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2024-10-10 22:35:54,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:54,047 INFO L225 Difference]: With dead ends: 4187 [2024-10-10 22:35:54,047 INFO L226 Difference]: Without dead ends: 2505 [2024-10-10 22:35:54,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:54,050 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 236 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:54,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 111 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:35:54,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2024-10-10 22:35:54,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 2504. [2024-10-10 22:35:54,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2504 states, 2503 states have (on average 1.4702357171394327) internal successors, (3680), 2503 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3680 transitions. [2024-10-10 22:35:54,094 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3680 transitions. Word has length 166 [2024-10-10 22:35:54,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:54,095 INFO L471 AbstractCegarLoop]: Abstraction has 2504 states and 3680 transitions. [2024-10-10 22:35:54,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:54,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3680 transitions. [2024-10-10 22:35:54,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-10 22:35:54,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:54,098 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:54,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:35:54,098 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:54,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:54,099 INFO L85 PathProgramCache]: Analyzing trace with hash 445037310, now seen corresponding path program 1 times [2024-10-10 22:35:54,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:54,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105907879] [2024-10-10 22:35:54,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:54,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:35:54,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:54,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105907879] [2024-10-10 22:35:54,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105907879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:54,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:54,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:35:54,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190419530] [2024-10-10 22:35:54,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:54,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:54,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:54,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:54,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:54,238 INFO L87 Difference]: Start difference. First operand 2504 states and 3680 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:54,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:54,818 INFO L93 Difference]: Finished difference Result 5006 states and 7358 transitions. [2024-10-10 22:35:54,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:54,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2024-10-10 22:35:54,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:54,832 INFO L225 Difference]: With dead ends: 5006 [2024-10-10 22:35:54,833 INFO L226 Difference]: Without dead ends: 2503 [2024-10-10 22:35:54,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:54,835 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 121 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:54,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 376 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:35:54,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2024-10-10 22:35:54,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2501. [2024-10-10 22:35:54,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 2500 states have (on average 1.3664) internal successors, (3416), 2500 states have internal predecessors, (3416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:54,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 3416 transitions. [2024-10-10 22:35:54,867 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 3416 transitions. Word has length 171 [2024-10-10 22:35:54,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:54,868 INFO L471 AbstractCegarLoop]: Abstraction has 2501 states and 3416 transitions. [2024-10-10 22:35:54,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:54,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3416 transitions. [2024-10-10 22:35:54,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-10 22:35:54,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:54,872 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:54,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:35:54,872 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:54,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:54,872 INFO L85 PathProgramCache]: Analyzing trace with hash 197530659, now seen corresponding path program 1 times [2024-10-10 22:35:54,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:54,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253860493] [2024-10-10 22:35:54,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:54,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:55,080 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:35:55,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:55,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253860493] [2024-10-10 22:35:55,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253860493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:55,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:55,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:35:55,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389080481] [2024-10-10 22:35:55,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:55,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:55,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:55,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:55,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:55,083 INFO L87 Difference]: Start difference. First operand 2501 states and 3416 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:55,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:55,755 INFO L93 Difference]: Finished difference Result 7438 states and 10164 transitions. [2024-10-10 22:35:55,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:55,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 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 173 [2024-10-10 22:35:55,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:55,766 INFO L225 Difference]: With dead ends: 7438 [2024-10-10 22:35:55,766 INFO L226 Difference]: Without dead ends: 4938 [2024-10-10 22:35:55,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:55,772 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 210 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:55,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 185 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:35:55,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2024-10-10 22:35:55,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4125. [2024-10-10 22:35:55,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4125 states, 4124 states have (on average 1.2580019398642095) internal successors, (5188), 4124 states have internal predecessors, (5188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:55,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 5188 transitions. [2024-10-10 22:35:55,826 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 5188 transitions. Word has length 173 [2024-10-10 22:35:55,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:55,826 INFO L471 AbstractCegarLoop]: Abstraction has 4125 states and 5188 transitions. [2024-10-10 22:35:55,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:55,827 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 5188 transitions. [2024-10-10 22:35:55,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-10 22:35:55,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:55,830 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:55,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:35:55,831 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:55,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:55,831 INFO L85 PathProgramCache]: Analyzing trace with hash 480080009, now seen corresponding path program 1 times [2024-10-10 22:35:55,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:55,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454239610] [2024-10-10 22:35:55,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:55,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:35:56,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:56,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454239610] [2024-10-10 22:35:56,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454239610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:56,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:56,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:35:56,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722467458] [2024-10-10 22:35:56,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:56,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:35:56,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:56,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:35:56,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:35:56,038 INFO L87 Difference]: Start difference. First operand 4125 states and 5188 transitions. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:57,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:57,109 INFO L93 Difference]: Finished difference Result 16224 states and 20442 transitions. [2024-10-10 22:35:57,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:35:57,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 183 [2024-10-10 22:35:57,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:57,135 INFO L225 Difference]: With dead ends: 16224 [2024-10-10 22:35:57,135 INFO L226 Difference]: Without dead ends: 12100 [2024-10-10 22:35:57,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:35:57,143 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 888 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:57,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 111 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 22:35:57,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12100 states. [2024-10-10 22:35:57,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12100 to 12096. [2024-10-10 22:35:57,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12096 states, 12095 states have (on average 1.2502687060768913) internal successors, (15122), 12095 states have internal predecessors, (15122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:57,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12096 states to 12096 states and 15122 transitions. [2024-10-10 22:35:57,365 INFO L78 Accepts]: Start accepts. Automaton has 12096 states and 15122 transitions. Word has length 183 [2024-10-10 22:35:57,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:57,366 INFO L471 AbstractCegarLoop]: Abstraction has 12096 states and 15122 transitions. [2024-10-10 22:35:57,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:57,366 INFO L276 IsEmpty]: Start isEmpty. Operand 12096 states and 15122 transitions. [2024-10-10 22:35:57,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-10 22:35:57,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:57,373 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:57,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 22:35:57,373 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:57,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:57,374 INFO L85 PathProgramCache]: Analyzing trace with hash 856437479, now seen corresponding path program 1 times [2024-10-10 22:35:57,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:57,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787358562] [2024-10-10 22:35:57,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:57,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:57,608 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:35:57,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:57,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787358562] [2024-10-10 22:35:57,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787358562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:57,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:57,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:35:57,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131332972] [2024-10-10 22:35:57,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:57,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:57,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:57,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:57,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:57,611 INFO L87 Difference]: Start difference. First operand 12096 states and 15122 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:58,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:58,314 INFO L93 Difference]: Finished difference Result 31524 states and 39382 transitions. [2024-10-10 22:35:58,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:58,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2024-10-10 22:35:58,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:58,347 INFO L225 Difference]: With dead ends: 31524 [2024-10-10 22:35:58,347 INFO L226 Difference]: Without dead ends: 19429 [2024-10-10 22:35:58,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:58,361 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 193 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:58,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 379 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:35:58,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19429 states. [2024-10-10 22:35:58,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19429 to 18186. [2024-10-10 22:35:58,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18186 states, 18185 states have (on average 1.2152323343414901) internal successors, (22099), 18185 states have internal predecessors, (22099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:58,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18186 states to 18186 states and 22099 transitions. [2024-10-10 22:35:58,584 INFO L78 Accepts]: Start accepts. Automaton has 18186 states and 22099 transitions. Word has length 205 [2024-10-10 22:35:58,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:58,584 INFO L471 AbstractCegarLoop]: Abstraction has 18186 states and 22099 transitions. [2024-10-10 22:35:58,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 18186 states and 22099 transitions. [2024-10-10 22:35:58,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-10 22:35:58,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:58,591 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 22:35:58,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 22:35:58,591 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:58,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:58,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1996331714, now seen corresponding path program 1 times [2024-10-10 22:35:58,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:58,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841044944] [2024-10-10 22:35:58,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:58,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:35:58,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:58,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841044944] [2024-10-10 22:35:58,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841044944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:58,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:58,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:35:58,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93931123] [2024-10-10 22:35:58,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:58,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:35:58,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:58,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:35:58,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:35:58,866 INFO L87 Difference]: Start difference. First operand 18186 states and 22099 transitions. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:59,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:59,831 INFO L93 Difference]: Finished difference Result 38844 states and 47350 transitions. [2024-10-10 22:35:59,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:35:59,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221 [2024-10-10 22:35:59,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:59,861 INFO L225 Difference]: With dead ends: 38844 [2024-10-10 22:35:59,861 INFO L226 Difference]: Without dead ends: 20659 [2024-10-10 22:35:59,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:35:59,879 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 391 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:59,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 172 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 22:35:59,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20659 states. [2024-10-10 22:36:00,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20659 to 17780. [2024-10-10 22:36:00,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17780 states, 17779 states have (on average 1.2131728443669498) internal successors, (21569), 17779 states have internal predecessors, (21569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:00,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17780 states to 17780 states and 21569 transitions. [2024-10-10 22:36:00,087 INFO L78 Accepts]: Start accepts. Automaton has 17780 states and 21569 transitions. Word has length 221 [2024-10-10 22:36:00,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:00,088 INFO L471 AbstractCegarLoop]: Abstraction has 17780 states and 21569 transitions. [2024-10-10 22:36:00,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:00,088 INFO L276 IsEmpty]: Start isEmpty. Operand 17780 states and 21569 transitions. [2024-10-10 22:36:00,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-10 22:36:00,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:00,094 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, 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] [2024-10-10 22:36:00,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 22:36:00,094 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:00,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:00,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1685120685, now seen corresponding path program 1 times [2024-10-10 22:36:00,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:00,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496209007] [2024-10-10 22:36:00,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:00,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-10 22:36:00,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:00,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496209007] [2024-10-10 22:36:00,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496209007] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:36:00,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591019524] [2024-10-10 22:36:00,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:00,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:36:00,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:36:00,495 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:36:00,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:36:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:00,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:36:00,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:36:00,701 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:36:00,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:36:00,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591019524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:00,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:36:00,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:36:00,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826535096] [2024-10-10 22:36:00,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:00,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:36:00,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:00,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:36:00,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:36:00,703 INFO L87 Difference]: Start difference. First operand 17780 states and 21569 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:01,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:01,477 INFO L93 Difference]: Finished difference Result 47360 states and 57199 transitions. [2024-10-10 22:36:01,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:36:01,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 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 228 [2024-10-10 22:36:01,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:01,511 INFO L225 Difference]: With dead ends: 47360 [2024-10-10 22:36:01,512 INFO L226 Difference]: Without dead ends: 29581 [2024-10-10 22:36:01,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:36:01,525 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 208 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:01,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 408 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:36:01,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29581 states. [2024-10-10 22:36:01,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29581 to 28551. [2024-10-10 22:36:01,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28551 states, 28550 states have (on average 1.1869352014010508) internal successors, (33887), 28550 states have internal predecessors, (33887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:01,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28551 states to 28551 states and 33887 transitions. [2024-10-10 22:36:01,791 INFO L78 Accepts]: Start accepts. Automaton has 28551 states and 33887 transitions. Word has length 228 [2024-10-10 22:36:01,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:01,791 INFO L471 AbstractCegarLoop]: Abstraction has 28551 states and 33887 transitions. [2024-10-10 22:36:01,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:01,792 INFO L276 IsEmpty]: Start isEmpty. Operand 28551 states and 33887 transitions. [2024-10-10 22:36:01,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-10-10 22:36:01,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:01,800 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2024-10-10 22:36:01,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 22:36:02,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-10 22:36:02,002 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:02,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:02,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1635143633, now seen corresponding path program 1 times [2024-10-10 22:36:02,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:02,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996246128] [2024-10-10 22:36:02,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:02,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-10 22:36:02,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:02,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996246128] [2024-10-10 22:36:02,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996246128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:02,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:36:02,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:36:02,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504407268] [2024-10-10 22:36:02,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:02,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:36:02,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:02,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:36:02,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:36:02,333 INFO L87 Difference]: Start difference. First operand 28551 states and 33887 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:02,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:02,978 INFO L93 Difference]: Finished difference Result 62600 states and 74144 transitions. [2024-10-10 22:36:02,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:36:02,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 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 240 [2024-10-10 22:36:02,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:03,014 INFO L225 Difference]: With dead ends: 62600 [2024-10-10 22:36:03,015 INFO L226 Difference]: Without dead ends: 34050 [2024-10-10 22:36:03,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:36:03,035 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 200 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:03,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 186 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:36:03,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34050 states. [2024-10-10 22:36:03,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34050 to 34034. [2024-10-10 22:36:03,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34034 states, 34033 states have (on average 1.1810301765933064) internal successors, (40194), 34033 states have internal predecessors, (40194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34034 states to 34034 states and 40194 transitions. [2024-10-10 22:36:03,414 INFO L78 Accepts]: Start accepts. Automaton has 34034 states and 40194 transitions. Word has length 240 [2024-10-10 22:36:03,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:03,414 INFO L471 AbstractCegarLoop]: Abstraction has 34034 states and 40194 transitions. [2024-10-10 22:36:03,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:03,415 INFO L276 IsEmpty]: Start isEmpty. Operand 34034 states and 40194 transitions. [2024-10-10 22:36:03,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-10 22:36:03,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:03,428 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, 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] [2024-10-10 22:36:03,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 22:36:03,428 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:03,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:03,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1899808268, now seen corresponding path program 1 times [2024-10-10 22:36:03,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:03,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370495020] [2024-10-10 22:36:03,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:03,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:03,828 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-10 22:36:03,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:03,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370495020] [2024-10-10 22:36:03,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370495020] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:36:03,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522589920] [2024-10-10 22:36:03,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:03,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:36:03,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:36:03,830 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:36:03,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 22:36:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:03,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:36:03,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:36:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-10 22:36:04,155 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:36:04,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522589920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:04,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:36:04,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:36:04,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135496002] [2024-10-10 22:36:04,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:04,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:36:04,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:04,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:36:04,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:36:04,158 INFO L87 Difference]: Start difference. First operand 34034 states and 40194 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:04,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:04,846 INFO L93 Difference]: Finished difference Result 69097 states and 81461 transitions. [2024-10-10 22:36:04,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:36:04,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 248 [2024-10-10 22:36:04,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:04,893 INFO L225 Difference]: With dead ends: 69097 [2024-10-10 22:36:04,893 INFO L226 Difference]: Without dead ends: 35064 [2024-10-10 22:36:04,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:36:04,923 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 114 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:04,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 125 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:36:04,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35064 states. [2024-10-10 22:36:05,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35064 to 32613. [2024-10-10 22:36:05,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32613 states, 32612 states have (on average 1.1466944682938796) internal successors, (37396), 32612 states have internal predecessors, (37396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:05,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32613 states to 32613 states and 37396 transitions. [2024-10-10 22:36:05,370 INFO L78 Accepts]: Start accepts. Automaton has 32613 states and 37396 transitions. Word has length 248 [2024-10-10 22:36:05,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:05,371 INFO L471 AbstractCegarLoop]: Abstraction has 32613 states and 37396 transitions. [2024-10-10 22:36:05,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:05,371 INFO L276 IsEmpty]: Start isEmpty. Operand 32613 states and 37396 transitions. [2024-10-10 22:36:05,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-10 22:36:05,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:05,381 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:36:05,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 22:36:05,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:36:05,585 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:05,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:05,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1009129412, now seen corresponding path program 1 times [2024-10-10 22:36:05,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:05,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624436234] [2024-10-10 22:36:05,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:05,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:36:05,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:05,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624436234] [2024-10-10 22:36:05,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624436234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:05,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:36:05,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:36:05,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776619610] [2024-10-10 22:36:05,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:05,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:36:05,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:05,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:36:05,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:36:05,874 INFO L87 Difference]: Start difference. First operand 32613 states and 37396 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 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-10 22:36:06,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:06,524 INFO L93 Difference]: Finished difference Result 70933 states and 81424 transitions. [2024-10-10 22:36:06,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:36:06,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 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 249 [2024-10-10 22:36:06,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:06,563 INFO L225 Difference]: With dead ends: 70933 [2024-10-10 22:36:06,563 INFO L226 Difference]: Without dead ends: 36900 [2024-10-10 22:36:06,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:36:06,587 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 142 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:06,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 403 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:36:06,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36900 states. [2024-10-10 22:36:06,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36900 to 30191. [2024-10-10 22:36:06,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30191 states, 30190 states have (on average 1.1096389532957933) internal successors, (33500), 30190 states have internal predecessors, (33500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:06,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30191 states to 30191 states and 33500 transitions. [2024-10-10 22:36:06,889 INFO L78 Accepts]: Start accepts. Automaton has 30191 states and 33500 transitions. Word has length 249 [2024-10-10 22:36:06,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:06,889 INFO L471 AbstractCegarLoop]: Abstraction has 30191 states and 33500 transitions. [2024-10-10 22:36:06,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 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-10 22:36:06,890 INFO L276 IsEmpty]: Start isEmpty. Operand 30191 states and 33500 transitions. [2024-10-10 22:36:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-10-10 22:36:06,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:06,897 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 22:36:06,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 22:36:06,898 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:06,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:06,898 INFO L85 PathProgramCache]: Analyzing trace with hash -375318906, now seen corresponding path program 1 times [2024-10-10 22:36:06,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:06,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887010615] [2024-10-10 22:36:06,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:06,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:07,132 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-10 22:36:07,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:07,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887010615] [2024-10-10 22:36:07,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887010615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:07,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:36:07,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:36:07,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208596428] [2024-10-10 22:36:07,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:07,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:36:07,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:07,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:36:07,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:36:07,134 INFO L87 Difference]: Start difference. First operand 30191 states and 33500 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:07,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:07,710 INFO L93 Difference]: Finished difference Result 78740 states and 87458 transitions. [2024-10-10 22:36:07,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:36:07,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 262 [2024-10-10 22:36:07,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:07,764 INFO L225 Difference]: With dead ends: 78740 [2024-10-10 22:36:07,764 INFO L226 Difference]: Without dead ends: 48550 [2024-10-10 22:36:07,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:36:07,792 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 211 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:07,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 140 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:36:07,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48550 states. [2024-10-10 22:36:08,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48550 to 48139. [2024-10-10 22:36:08,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48139 states, 48138 states have (on average 1.1111180356475134) internal successors, (53487), 48138 states have internal predecessors, (53487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48139 states to 48139 states and 53487 transitions. [2024-10-10 22:36:08,246 INFO L78 Accepts]: Start accepts. Automaton has 48139 states and 53487 transitions. Word has length 262 [2024-10-10 22:36:08,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:08,247 INFO L471 AbstractCegarLoop]: Abstraction has 48139 states and 53487 transitions. [2024-10-10 22:36:08,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:08,247 INFO L276 IsEmpty]: Start isEmpty. Operand 48139 states and 53487 transitions. [2024-10-10 22:36:08,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-10-10 22:36:08,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:08,258 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 22:36:08,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 22:36:08,258 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:08,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:08,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1554542357, now seen corresponding path program 1 times [2024-10-10 22:36:08,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:08,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255266642] [2024-10-10 22:36:08,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:08,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:08,596 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 68 proven. 6 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-10 22:36:08,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:08,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255266642] [2024-10-10 22:36:08,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255266642] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:36:08,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347799282] [2024-10-10 22:36:08,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:08,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:36:08,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:36:08,598 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:36:08,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 22:36:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:08,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:36:08,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:36:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-10 22:36:08,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:36:08,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347799282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:08,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:36:08,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:36:08,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217925134] [2024-10-10 22:36:08,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:08,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:36:08,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:08,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:36:08,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:36:08,856 INFO L87 Difference]: Start difference. First operand 48139 states and 53487 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:09,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:09,667 INFO L93 Difference]: Finished difference Result 128435 states and 142721 transitions. [2024-10-10 22:36:09,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:36:09,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 269 [2024-10-10 22:36:09,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:09,759 INFO L225 Difference]: With dead ends: 128435 [2024-10-10 22:36:09,760 INFO L226 Difference]: Without dead ends: 80297 [2024-10-10 22:36:09,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:36:09,800 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 104 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:09,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 186 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:36:09,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80297 states. [2024-10-10 22:36:10,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80297 to 71764. [2024-10-10 22:36:10,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71764 states, 71763 states have (on average 1.1076878056937418) internal successors, (79491), 71763 states have internal predecessors, (79491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71764 states to 71764 states and 79491 transitions. [2024-10-10 22:36:10,851 INFO L78 Accepts]: Start accepts. Automaton has 71764 states and 79491 transitions. Word has length 269 [2024-10-10 22:36:10,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:10,852 INFO L471 AbstractCegarLoop]: Abstraction has 71764 states and 79491 transitions. [2024-10-10 22:36:10,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 71764 states and 79491 transitions. [2024-10-10 22:36:10,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-10-10 22:36:10,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:10,876 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 22:36:10,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-10 22:36:11,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:36:11,077 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:11,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:11,077 INFO L85 PathProgramCache]: Analyzing trace with hash -144983928, now seen corresponding path program 1 times [2024-10-10 22:36:11,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:11,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802967529] [2024-10-10 22:36:11,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:11,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:11,464 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 189 proven. 6 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-10-10 22:36:11,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:11,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802967529] [2024-10-10 22:36:11,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802967529] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:36:11,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260299496] [2024-10-10 22:36:11,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:11,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:36:11,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:36:11,467 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:36:11,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 22:36:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:11,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:36:11,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:36:11,921 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-10 22:36:11,922 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:36:11,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260299496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:11,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:36:11,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 22:36:11,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865711152] [2024-10-10 22:36:11,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:11,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:36:11,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:11,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:36:11,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:36:11,923 INFO L87 Difference]: Start difference. First operand 71764 states and 79491 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 2 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:12,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:12,485 INFO L93 Difference]: Finished difference Result 212440 states and 235408 transitions. [2024-10-10 22:36:12,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:36:12,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 2 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 334 [2024-10-10 22:36:12,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:12,649 INFO L225 Difference]: With dead ends: 212440 [2024-10-10 22:36:12,649 INFO L226 Difference]: Without dead ends: 141083 [2024-10-10 22:36:12,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:36:12,713 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 244 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:12,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 574 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:36:12,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141083 states. [2024-10-10 22:36:14,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141083 to 141081. [2024-10-10 22:36:14,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141081 states, 141080 states have (on average 1.1075418202438332) internal successors, (156252), 141080 states have internal predecessors, (156252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:15,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141081 states to 141081 states and 156252 transitions. [2024-10-10 22:36:15,055 INFO L78 Accepts]: Start accepts. Automaton has 141081 states and 156252 transitions. Word has length 334 [2024-10-10 22:36:15,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:15,057 INFO L471 AbstractCegarLoop]: Abstraction has 141081 states and 156252 transitions. [2024-10-10 22:36:15,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 2 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:15,057 INFO L276 IsEmpty]: Start isEmpty. Operand 141081 states and 156252 transitions. [2024-10-10 22:36:15,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2024-10-10 22:36:15,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:15,101 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 22:36:15,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-10 22:36:15,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-10 22:36:15,303 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:15,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:15,304 INFO L85 PathProgramCache]: Analyzing trace with hash -552380248, now seen corresponding path program 1 times [2024-10-10 22:36:15,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:15,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800872192] [2024-10-10 22:36:15,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:15,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:15,768 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2024-10-10 22:36:15,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:15,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800872192] [2024-10-10 22:36:15,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800872192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:15,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:36:15,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:36:15,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046831491] [2024-10-10 22:36:15,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:15,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:36:15,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:15,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:36:15,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:36:15,769 INFO L87 Difference]: Start difference. First operand 141081 states and 156252 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:16,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:16,951 INFO L93 Difference]: Finished difference Result 317068 states and 351788 transitions. [2024-10-10 22:36:16,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:36:16,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 443 [2024-10-10 22:36:16,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:17,323 INFO L225 Difference]: With dead ends: 317068 [2024-10-10 22:36:17,324 INFO L226 Difference]: Without dead ends: 175176 [2024-10-10 22:36:17,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:36:17,380 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 162 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:17,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 173 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:36:17,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175176 states. [2024-10-10 22:36:19,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175176 to 158551. [2024-10-10 22:36:19,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158551 states, 158550 states have (on average 1.1077956480605486) internal successors, (175641), 158550 states have internal predecessors, (175641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158551 states to 158551 states and 175641 transitions. [2024-10-10 22:36:19,743 INFO L78 Accepts]: Start accepts. Automaton has 158551 states and 175641 transitions. Word has length 443 [2024-10-10 22:36:19,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:19,743 INFO L471 AbstractCegarLoop]: Abstraction has 158551 states and 175641 transitions. [2024-10-10 22:36:19,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:19,744 INFO L276 IsEmpty]: Start isEmpty. Operand 158551 states and 175641 transitions. [2024-10-10 22:36:19,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2024-10-10 22:36:19,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:19,799 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 22:36:19,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 22:36:19,800 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:19,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:19,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1866485920, now seen corresponding path program 1 times [2024-10-10 22:36:19,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:19,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282558282] [2024-10-10 22:36:19,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:19,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-10 22:36:20,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:20,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282558282] [2024-10-10 22:36:20,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282558282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:20,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:36:20,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:36:20,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525741644] [2024-10-10 22:36:20,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:20,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:36:20,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:20,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:36:20,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:36:20,188 INFO L87 Difference]: Start difference. First operand 158551 states and 175641 transitions. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:21,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:21,646 INFO L93 Difference]: Finished difference Result 300710 states and 332585 transitions. [2024-10-10 22:36:21,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:36:21,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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 444 [2024-10-10 22:36:21,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:21,849 INFO L225 Difference]: With dead ends: 300710 [2024-10-10 22:36:21,849 INFO L226 Difference]: Without dead ends: 139724 [2024-10-10 22:36:21,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:36:21,920 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 130 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:21,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 325 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:36:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139724 states. [2024-10-10 22:36:23,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139724 to 124263. [2024-10-10 22:36:23,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124263 states, 124262 states have (on average 1.0864785694741754) internal successors, (135008), 124262 states have internal predecessors, (135008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124263 states to 124263 states and 135008 transitions. [2024-10-10 22:36:23,733 INFO L78 Accepts]: Start accepts. Automaton has 124263 states and 135008 transitions. Word has length 444 [2024-10-10 22:36:23,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:23,734 INFO L471 AbstractCegarLoop]: Abstraction has 124263 states and 135008 transitions. [2024-10-10 22:36:23,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:23,734 INFO L276 IsEmpty]: Start isEmpty. Operand 124263 states and 135008 transitions. [2024-10-10 22:36:23,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2024-10-10 22:36:23,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:23,828 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:36:23,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 22:36:23,829 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:23,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:23,829 INFO L85 PathProgramCache]: Analyzing trace with hash -800983689, now seen corresponding path program 1 times [2024-10-10 22:36:23,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:23,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753343025] [2024-10-10 22:36:23,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:23,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1644 backedges. 507 proven. 0 refuted. 0 times theorem prover too weak. 1137 trivial. 0 not checked. [2024-10-10 22:36:24,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:24,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753343025] [2024-10-10 22:36:24,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753343025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:24,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:36:24,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:36:24,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561256138] [2024-10-10 22:36:24,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:24,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:36:24,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:24,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:36:24,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:36:24,661 INFO L87 Difference]: Start difference. First operand 124263 states and 135008 transitions. Second operand has 4 states, 4 states have (on average 66.75) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:25,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:25,979 INFO L93 Difference]: Finished difference Result 266467 states and 289413 transitions. [2024-10-10 22:36:25,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:36:25,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.75) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 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 671 [2024-10-10 22:36:25,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:26,168 INFO L225 Difference]: With dead ends: 266467 [2024-10-10 22:36:26,168 INFO L226 Difference]: Without dead ends: 142611 [2024-10-10 22:36:26,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:36:26,257 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 360 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:26,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 116 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:36:26,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142611 states. [2024-10-10 22:36:27,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142611 to 124466. [2024-10-10 22:36:28,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124466 states, 124465 states have (on average 1.0863937653155507) internal successors, (135218), 124465 states have internal predecessors, (135218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124466 states to 124466 states and 135218 transitions. [2024-10-10 22:36:28,238 INFO L78 Accepts]: Start accepts. Automaton has 124466 states and 135218 transitions. Word has length 671 [2024-10-10 22:36:28,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:28,239 INFO L471 AbstractCegarLoop]: Abstraction has 124466 states and 135218 transitions. [2024-10-10 22:36:28,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.75) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:28,239 INFO L276 IsEmpty]: Start isEmpty. Operand 124466 states and 135218 transitions. [2024-10-10 22:36:28,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2024-10-10 22:36:28,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:28,329 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:36:28,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 22:36:28,330 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:28,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:28,330 INFO L85 PathProgramCache]: Analyzing trace with hash -2010415943, now seen corresponding path program 1 times [2024-10-10 22:36:28,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:28,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62003931] [2024-10-10 22:36:28,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:28,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 937 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2024-10-10 22:36:29,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:29,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62003931] [2024-10-10 22:36:29,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62003931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:29,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:36:29,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:36:29,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754836418] [2024-10-10 22:36:29,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:29,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:36:29,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:29,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:36:29,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:36:29,280 INFO L87 Difference]: Start difference. First operand 124466 states and 135218 transitions. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:30,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:30,519 INFO L93 Difference]: Finished difference Result 252004 states and 273784 transitions. [2024-10-10 22:36:30,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:36:30,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 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 673 [2024-10-10 22:36:30,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:30,660 INFO L225 Difference]: With dead ends: 252004 [2024-10-10 22:36:30,660 INFO L226 Difference]: Without dead ends: 128351 [2024-10-10 22:36:30,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:36:30,728 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 217 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:30,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 161 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:36:30,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128351 states. [2024-10-10 22:36:32,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128351 to 127917. [2024-10-10 22:36:32,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127917 states, 127916 states have (on average 1.0809828324838175) internal successors, (138275), 127916 states have internal predecessors, (138275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:32,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127917 states to 127917 states and 138275 transitions. [2024-10-10 22:36:32,619 INFO L78 Accepts]: Start accepts. Automaton has 127917 states and 138275 transitions. Word has length 673 [2024-10-10 22:36:32,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:32,620 INFO L471 AbstractCegarLoop]: Abstraction has 127917 states and 138275 transitions. [2024-10-10 22:36:32,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:32,620 INFO L276 IsEmpty]: Start isEmpty. Operand 127917 states and 138275 transitions. [2024-10-10 22:36:32,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2024-10-10 22:36:32,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:36:32,718 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:36:32,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 22:36:32,719 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:36:32,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:36:32,719 INFO L85 PathProgramCache]: Analyzing trace with hash -869313947, now seen corresponding path program 1 times [2024-10-10 22:36:32,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:36:32,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423222248] [2024-10-10 22:36:32,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:32,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:36:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:35,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1541 backedges. 839 proven. 119 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2024-10-10 22:36:35,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:36:35,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423222248] [2024-10-10 22:36:35,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423222248] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:36:35,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626693094] [2024-10-10 22:36:35,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:36:35,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:36:35,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:36:35,181 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:36:35,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 22:36:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:36:35,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 1102 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:36:35,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:36:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1541 backedges. 1069 proven. 0 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2024-10-10 22:36:35,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:36:35,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626693094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:36:35,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:36:35,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 22:36:35,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608540500] [2024-10-10 22:36:35,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:36:35,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:36:35,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:36:35,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:36:35,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:36:35,544 INFO L87 Difference]: Start difference. First operand 127917 states and 138275 transitions. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:36,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:36:36,324 INFO L93 Difference]: Finished difference Result 182658 states and 197042 transitions. [2024-10-10 22:36:36,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:36:36,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 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 690 [2024-10-10 22:36:36,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:36:36,329 INFO L225 Difference]: With dead ends: 182658 [2024-10-10 22:36:36,329 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 22:36:36,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 689 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:36:36,388 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 140 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:36:36,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 329 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:36:36,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 22:36:36,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 22:36:36,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:36,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 22:36:36,391 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 690 [2024-10-10 22:36:36,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:36:36,391 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 22:36:36,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:36:36,391 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 22:36:36,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 22:36:36,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:36:36,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-10 22:36:36,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-10 22:36:36,601 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:36:36,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 22:36:49,511 WARN L286 SmtUtils]: Spent 12.90s on a formula simplification. DAG size of input: 682 DAG size of output: 822 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-10 22:36:53,604 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:36:53,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:36:53 BoogieIcfgContainer [2024-10-10 22:36:53,632 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:36:53,632 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:36:53,632 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:36:53,633 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:36:53,633 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:35:49" (3/4) ... [2024-10-10 22:36:53,637 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 22:36:53,663 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 22:36:53,665 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 22:36:53,667 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 22:36:53,668 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 22:36:53,842 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 22:36:53,842 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 22:36:53,842 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:36:53,845 INFO L158 Benchmark]: Toolchain (without parser) took 66924.75ms. Allocated memory was 211.8MB in the beginning and 13.9GB in the end (delta: 13.7GB). Free memory was 136.1MB in the beginning and 8.6GB in the end (delta: -8.5GB). Peak memory consumption was 5.2GB. Max. memory is 16.1GB. [2024-10-10 22:36:53,845 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 130.0MB. Free memory is still 89.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:36:53,846 INFO L158 Benchmark]: CACSL2BoogieTranslator took 628.77ms. Allocated memory is still 211.8MB. Free memory was 136.1MB in the beginning and 71.0MB in the end (delta: 65.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-10-10 22:36:53,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 147.32ms. Allocated memory is still 211.8MB. Free memory was 71.0MB in the beginning and 162.9MB in the end (delta: -91.9MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2024-10-10 22:36:53,846 INFO L158 Benchmark]: Boogie Preprocessor took 141.13ms. Allocated memory is still 211.8MB. Free memory was 162.9MB in the beginning and 150.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 22:36:53,846 INFO L158 Benchmark]: RCFGBuilder took 1519.84ms. Allocated memory is still 211.8MB. Free memory was 150.3MB in the beginning and 104.4MB in the end (delta: 46.0MB). Peak memory consumption was 106.8MB. Max. memory is 16.1GB. [2024-10-10 22:36:53,846 INFO L158 Benchmark]: TraceAbstraction took 64263.73ms. Allocated memory was 211.8MB in the beginning and 13.9GB in the end (delta: 13.7GB). Free memory was 104.4MB in the beginning and 8.6GB in the end (delta: -8.5GB). Peak memory consumption was 5.9GB. Max. memory is 16.1GB. [2024-10-10 22:36:53,847 INFO L158 Benchmark]: Witness Printer took 209.93ms. Allocated memory is still 13.9GB. Free memory was 8.6GB in the beginning and 8.6GB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-10 22:36:53,848 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.12ms. Allocated memory is still 130.0MB. Free memory is still 89.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 628.77ms. Allocated memory is still 211.8MB. Free memory was 136.1MB in the beginning and 71.0MB in the end (delta: 65.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 147.32ms. Allocated memory is still 211.8MB. Free memory was 71.0MB in the beginning and 162.9MB in the end (delta: -91.9MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 141.13ms. Allocated memory is still 211.8MB. Free memory was 162.9MB in the beginning and 150.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1519.84ms. Allocated memory is still 211.8MB. Free memory was 150.3MB in the beginning and 104.4MB in the end (delta: 46.0MB). Peak memory consumption was 106.8MB. Max. memory is 16.1GB. * TraceAbstraction took 64263.73ms. Allocated memory was 211.8MB in the beginning and 13.9GB in the end (delta: 13.7GB). Free memory was 104.4MB in the beginning and 8.6GB in the end (delta: -8.5GB). Peak memory consumption was 5.9GB. Max. memory is 16.1GB. * Witness Printer took 209.93ms. Allocated memory is still 13.9GB. Free memory was 8.6GB in the beginning and 8.6GB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. 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: 1516]: 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: 47.2s, OverallIterations: 22, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 19.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4892 SdHoareTripleChecker+Valid, 12.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4892 mSDsluCounter, 5186 SdHoareTripleChecker+Invalid, 10.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 808 mSDsCounter, 2419 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13666 IncrementalHoareTripleChecker+Invalid, 16085 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2419 mSolverCounterUnsat, 4378 mSDtfsCounter, 13666 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1824 GetRequests, 1787 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158551occurred in iteration=18, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 74781 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 8276 NumberOfCodeBlocks, 8276 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 8249 ConstructedInterpolants, 0 QuantifiedInterpolants, 18986 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3157 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 27 InterpolantComputations, 22 PerfectInterpolantSequences, 9205/9348 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: ((((((((((((((((((((((((((((((((((((((a26 == 1) && (a5 == 1)) && (a10 == 1)) && (a3 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a27 == 1)) || (((((((a26 == 1) && (a5 == 1)) && (a3 <= 1)) && (a10 == 1)) && (a7 != 1)) && (a6 == 1)) && (a27 == 1))) || ((((((a5 == 1) && (a12 == 1)) && (a10 == 1)) && (a7 != 1)) && (a11 <= 0)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 <= 1)) && (a11 == 1)) && (a27 == 1)) && (a6 <= 0))) || ((((((a5 == 1) && (a10 == 1)) && (a7 != 1)) && (a11 == 1)) && (a12 <= 0)) && (a6 <= 0))) || (((((((((a15 == 1) && (a26 == 1)) && (a20 <= 0)) && (a5 == 1)) && (a3 <= 1)) && (a10 == 1)) && (a12 <= 0)) && (a27 == 1)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a10 == 1)) && (a3 <= 0)) && (a11 == 1)) && (a6 <= 0))) || ((((((a5 == 1) && (a10 == 1)) && (a7 != 1)) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a3 <= 1)) && (a10 == 1)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1))) || ((((((((a15 == 1) && (a5 == 1)) && (a12 == 1)) && (a10 == 1)) && (a7 != 1)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1))) || ((((((a5 == 1) && (a3 <= 1)) && (a10 == 1)) && (a11 == 1)) && (a12 <= 0)) && (a6 <= 0))) || ((((((a5 == 1) && (a12 == 1)) && (a10 == 1)) && (a3 <= 0)) && (a11 <= 0)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a3 <= 1)) && (a10 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1))) || ((((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a10 == 1)) && (a3 <= 0)) && (a7 != 1)) && (a11 == 1)) && (a6 == 1))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 <= 1)) && (a6 == 1)) && (a27 == 1))) || ((((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a10 == 1)) && (a3 <= 0)) && (a16 == 1)) && (a8 == 1)) && (a6 <= 0))) || ((((((a5 == 1) && (a10 == 1)) && (a3 <= 0)) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0))) || ((((((a5 == 1) && (a10 == 1)) && (a7 != 1)) && (a6 == 1)) && (a11 <= 0)) && (a12 <= 0))) || (((((((a5 == 1) && (a12 == 1)) && (a10 == 1)) && (a7 != 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1))) || (((((((a5 == 1) && (a3 <= 1)) && (a10 == 1)) && (a7 != 1)) && (a11 <= 0)) && (a12 <= 0)) && (a6 <= 0))) || (((a12 == 1) && (((((a26 == 1) && (a5 == 1)) && (a27 == 1)) && (a6 <= 0)) || ((((a26 == 1) && (a5 == 1)) && (a11 <= 0)) && (a6 <= 0)))) && (a3 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a10 == 1)) && (a7 != 1)) && (a11 == 1)) && (a6 <= 0))) || ((((((((a5 == 1) && (a12 == 1)) && (a10 == 1)) && (1 <= a3)) && (a7 != 1)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1))) || (((((((a5 == 1) && (a12 == 1)) && (a3 <= 1)) && (a10 == 1)) && (a7 != 1)) && (a6 == 1)) && (a11 <= 0))) || ((((((((a5 == 1) && (a12 == 1)) && (a10 == 1)) && (a16 == 1)) && (a7 != 1)) && (a6 == 1)) && (a11 <= 0)) && (a26 == a8))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a10 == 1)) && (a7 != 1)) && (a6 == 1)) && (a11 <= 0))) || (((((((a20 <= 0) && (a5 == 1)) && (a10 == 1)) && (a7 != 1)) && (a11 <= 0)) && (a12 <= 0)) && (a6 <= 0))) || (((((((a5 == 1) && (a12 == 1)) && (a10 == 1)) && (a7 != 1)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1))) || ((((((a5 == 1) && (a12 == 1)) && (a10 == 1)) && (a11 == 1)) && (a3 == 1)) && (a6 <= 0))) || (((((((a5 == 1) && (a12 == 1)) && (a3 <= 1)) && (a10 == 1)) && (a11 <= 0)) && (a6 <= 0)) && (a26 == a2))) || ((a27 == 1) && (((((((((a26 == 1) && (a20 <= 0)) && (a5 == 1)) && (a3 <= 1)) && (a10 == 1)) && (a7 != 1)) && (a12 <= 0)) && (a6 <= 0)) || ((((((((a26 == 1) && (a20 <= 0)) && (a5 == 1)) && (a3 <= 1)) && (a10 == 1)) && (a11 <= 0)) && (a12 <= 0)) && (a6 <= 0))))) || ((((((((a15 == 1) && (a26 == 1)) && (a5 == 1)) && (a10 == 1)) && (a3 <= 0)) && (a12 <= 0)) && (a27 == 1)) && (a6 <= 0))) RESULT: Ultimate proved your program to be correct! [2024-10-10 22:36:53,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE