./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/Problem11_label57.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label57.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ab973685a1b1efc862bdc104a7ab81fdba6d1304eec57508bfc6ec40b5ec7e50 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 21:03:59,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 21:03:59,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 21:03:59,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 21:03:59,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 21:03:59,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 21:03:59,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 21:03:59,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 21:03:59,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 21:03:59,795 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 21:03:59,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 21:03:59,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 21:03:59,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 21:03:59,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 21:03:59,797 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 21:03:59,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 21:03:59,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 21:03:59,798 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 21:03:59,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 21:03:59,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 21:03:59,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 21:03:59,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 21:03:59,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 21:03:59,800 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 21:03:59,800 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 21:03:59,800 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 21:03:59,801 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 21:03:59,801 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 21:03:59,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 21:03:59,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 21:03:59,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 21:03:59,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 21:03:59,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:03:59,803 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 21:03:59,803 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 21:03:59,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 21:03:59,803 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 21:03:59,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 21:03:59,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 21:03:59,804 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 21:03:59,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 21:03:59,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 21:03:59,805 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ab973685a1b1efc862bdc104a7ab81fdba6d1304eec57508bfc6ec40b5ec7e50 [2024-10-23 21:03:59,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 21:04:00,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 21:04:00,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 21:04:00,014 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 21:04:00,014 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 21:04:00,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label57.c [2024-10-23 21:04:01,266 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 21:04:01,497 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 21:04:01,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label57.c [2024-10-23 21:04:01,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9d70c4c/47bdbac05e5d49cfa151d50f0fa375c3/FLAG73b70b293 [2024-10-23 21:04:01,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9d70c4c/47bdbac05e5d49cfa151d50f0fa375c3 [2024-10-23 21:04:01,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 21:04:01,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 21:04:01,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 21:04:01,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 21:04:01,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 21:04:01,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:04:01" (1/1) ... [2024-10-23 21:04:01,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14313db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:04:01, skipping insertion in model container [2024-10-23 21:04:01,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:04:01" (1/1) ... [2024-10-23 21:04:01,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 21:04:01,873 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/Problem11_label57.c[6683,6696] [2024-10-23 21:04:02,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:04:02,031 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 21:04:02,058 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/Problem11_label57.c[6683,6696] [2024-10-23 21:04:02,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:04:02,147 INFO L204 MainTranslator]: Completed translation [2024-10-23 21:04:02,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:04:02 WrapperNode [2024-10-23 21:04:02,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 21:04:02,149 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 21:04:02,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 21:04:02,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 21:04:02,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:04:02" (1/1) ... [2024-10-23 21:04:02,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:04:02" (1/1) ... [2024-10-23 21:04:02,244 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-10-23 21:04:02,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 21:04:02,245 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 21:04:02,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 21:04:02,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 21:04:02,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:04:02" (1/1) ... [2024-10-23 21:04:02,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:04:02" (1/1) ... [2024-10-23 21:04:02,267 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:04:02" (1/1) ... [2024-10-23 21:04:02,312 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-23 21:04:02,313 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:04:02" (1/1) ... [2024-10-23 21:04:02,313 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:04:02" (1/1) ... [2024-10-23 21:04:02,336 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:04:02" (1/1) ... [2024-10-23 21:04:02,350 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:04:02" (1/1) ... [2024-10-23 21:04:02,358 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:04:02" (1/1) ... [2024-10-23 21:04:02,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:04:02" (1/1) ... [2024-10-23 21:04:02,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 21:04:02,380 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 21:04:02,381 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 21:04:02,381 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 21:04:02,381 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:04:02" (1/1) ... [2024-10-23 21:04:02,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:04:02,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:04:02,413 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 21:04:02,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 21:04:02,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 21:04:02,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 21:04:02,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 21:04:02,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 21:04:02,505 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 21:04:02,507 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 21:04:03,789 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-23 21:04:03,789 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 21:04:03,840 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 21:04:03,841 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 21:04:03,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:04:03 BoogieIcfgContainer [2024-10-23 21:04:03,841 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 21:04:03,843 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 21:04:03,843 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 21:04:03,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 21:04:03,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 09:04:01" (1/3) ... [2024-10-23 21:04:03,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a7bb20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:04:03, skipping insertion in model container [2024-10-23 21:04:03,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:04:02" (2/3) ... [2024-10-23 21:04:03,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a7bb20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:04:03, skipping insertion in model container [2024-10-23 21:04:03,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:04:03" (3/3) ... [2024-10-23 21:04:03,852 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label57.c [2024-10-23 21:04:03,867 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 21:04:03,868 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 21:04:03,937 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 21:04:03,943 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;@46042cb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 21:04:03,943 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 21:04:03,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:03,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-23 21:04:03,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:04:03,957 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] [2024-10-23 21:04:03,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:04:03,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:04:03,963 INFO L85 PathProgramCache]: Analyzing trace with hash -192275047, now seen corresponding path program 1 times [2024-10-23 21:04:03,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:04:03,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017744431] [2024-10-23 21:04:03,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:04:03,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:04:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:04:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:04:04,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:04:04,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017744431] [2024-10-23 21:04:04,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017744431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:04:04,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:04:04,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:04:04,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764347808] [2024-10-23 21:04:04,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:04:04,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 21:04:04,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:04:04,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 21:04:04,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 21:04:04,167 INFO L87 Difference]: Start difference. First operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 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 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:04,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:04:04,200 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2024-10-23 21:04:04,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 21:04:04,208 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2024-10-23 21:04:04,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:04:04,216 INFO L225 Difference]: With dead ends: 441 [2024-10-23 21:04:04,216 INFO L226 Difference]: Without dead ends: 219 [2024-10-23 21:04:04,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 21:04:04,222 INFO L432 NwaCegarLoop]: 355 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, 355 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 21:04:04,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 21:04:04,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-23 21:04:04,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-23 21:04:04,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:04,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2024-10-23 21:04:04,262 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 45 [2024-10-23 21:04:04,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:04:04,263 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2024-10-23 21:04:04,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:04,263 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2024-10-23 21:04:04,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-23 21:04:04,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:04:04,264 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] [2024-10-23 21:04:04,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 21:04:04,264 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:04:04,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:04:04,265 INFO L85 PathProgramCache]: Analyzing trace with hash 707728301, now seen corresponding path program 1 times [2024-10-23 21:04:04,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:04:04,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554948147] [2024-10-23 21:04:04,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:04:04,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:04:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:04:04,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:04:04,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:04:04,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554948147] [2024-10-23 21:04:04,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554948147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:04:04,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:04:04,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:04:04,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20209594] [2024-10-23 21:04:04,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:04:04,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:04:04,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:04:04,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:04:04,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:04:04,445 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:05,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:04:05,207 INFO L93 Difference]: Finished difference Result 639 states and 1042 transitions. [2024-10-23 21:04:05,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:04:05,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2024-10-23 21:04:05,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:04:05,210 INFO L225 Difference]: With dead ends: 639 [2024-10-23 21:04:05,210 INFO L226 Difference]: Without dead ends: 421 [2024-10-23 21:04:05,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:04:05,212 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 166 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:04:05,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 120 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:04:05,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-10-23 21:04:05,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 411. [2024-10-23 21:04:05,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.524390243902439) internal successors, (625), 410 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:05,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 625 transitions. [2024-10-23 21:04:05,242 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 625 transitions. Word has length 45 [2024-10-23 21:04:05,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:04:05,242 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 625 transitions. [2024-10-23 21:04:05,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:05,243 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 625 transitions. [2024-10-23 21:04:05,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-23 21:04:05,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:04:05,250 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:04:05,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 21:04:05,251 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:04:05,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:04:05,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1266584342, now seen corresponding path program 1 times [2024-10-23 21:04:05,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:04:05,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364854687] [2024-10-23 21:04:05,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:04:05,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:04:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:04:05,355 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:04:05,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:04:05,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364854687] [2024-10-23 21:04:05,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364854687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:04:05,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:04:05,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:04:05,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802433208] [2024-10-23 21:04:05,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:04:05,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:04:05,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:04:05,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:04:05,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:04:05,358 INFO L87 Difference]: Start difference. First operand 411 states and 625 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:06,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:04:06,003 INFO L93 Difference]: Finished difference Result 1193 states and 1820 transitions. [2024-10-23 21:04:06,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:04:06,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-10-23 21:04:06,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:04:06,006 INFO L225 Difference]: With dead ends: 1193 [2024-10-23 21:04:06,006 INFO L226 Difference]: Without dead ends: 783 [2024-10-23 21:04:06,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:04:06,009 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 175 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:04:06,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 152 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:04:06,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2024-10-23 21:04:06,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2024-10-23 21:04:06,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.3746803069053708) internal successors, (1075), 782 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:06,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1075 transitions. [2024-10-23 21:04:06,035 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1075 transitions. Word has length 111 [2024-10-23 21:04:06,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:04:06,036 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1075 transitions. [2024-10-23 21:04:06,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:06,037 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1075 transitions. [2024-10-23 21:04:06,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-23 21:04:06,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:04:06,038 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:04:06,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 21:04:06,038 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:04:06,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:04:06,039 INFO L85 PathProgramCache]: Analyzing trace with hash -756803552, now seen corresponding path program 1 times [2024-10-23 21:04:06,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:04:06,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58611519] [2024-10-23 21:04:06,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:04:06,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:04:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:04:06,343 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:04:06,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:04:06,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58611519] [2024-10-23 21:04:06,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58611519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:04:06,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:04:06,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:04:06,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017207181] [2024-10-23 21:04:06,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:04:06,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:04:06,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:04:06,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:04:06,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:04:06,347 INFO L87 Difference]: Start difference. First operand 783 states and 1075 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:04:06,954 INFO L93 Difference]: Finished difference Result 1935 states and 2598 transitions. [2024-10-23 21:04:06,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:04:06,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-10-23 21:04:06,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:04:06,960 INFO L225 Difference]: With dead ends: 1935 [2024-10-23 21:04:06,960 INFO L226 Difference]: Without dead ends: 1153 [2024-10-23 21:04:06,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:04:06,967 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:04:06,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 188 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:04:06,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-10-23 21:04:06,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1152. [2024-10-23 21:04:06,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1151 states have (on average 1.2701998262380538) internal successors, (1462), 1151 states have internal predecessors, (1462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1462 transitions. [2024-10-23 21:04:06,990 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1462 transitions. Word has length 115 [2024-10-23 21:04:06,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:04:06,992 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1462 transitions. [2024-10-23 21:04:06,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:06,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1462 transitions. [2024-10-23 21:04:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-23 21:04:06,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:04:06,996 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:04:06,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 21:04:06,997 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:04:06,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:04:06,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2124763081, now seen corresponding path program 1 times [2024-10-23 21:04:06,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:04:06,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306101581] [2024-10-23 21:04:06,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:04:06,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:04:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:04:07,148 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-23 21:04:07,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:04:07,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306101581] [2024-10-23 21:04:07,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306101581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:04:07,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:04:07,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:04:07,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938427739] [2024-10-23 21:04:07,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:04:07,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:04:07,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:04:07,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:04:07,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:04:07,151 INFO L87 Difference]: Start difference. First operand 1152 states and 1462 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:04:07,743 INFO L93 Difference]: Finished difference Result 2493 states and 3188 transitions. [2024-10-23 21:04:07,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:04:07,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 157 [2024-10-23 21:04:07,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:04:07,749 INFO L225 Difference]: With dead ends: 2493 [2024-10-23 21:04:07,749 INFO L226 Difference]: Without dead ends: 1526 [2024-10-23 21:04:07,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:04:07,751 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 106 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:04:07,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 152 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:04:07,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2024-10-23 21:04:07,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1525. [2024-10-23 21:04:07,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1524 states have (on average 1.2559055118110236) internal successors, (1914), 1524 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:07,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 1914 transitions. [2024-10-23 21:04:07,776 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 1914 transitions. Word has length 157 [2024-10-23 21:04:07,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:04:07,777 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 1914 transitions. [2024-10-23 21:04:07,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:07,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1914 transitions. [2024-10-23 21:04:07,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-23 21:04:07,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:04:07,779 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:04:07,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 21:04:07,780 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:04:07,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:04:07,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1579848260, now seen corresponding path program 1 times [2024-10-23 21:04:07,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:04:07,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569982030] [2024-10-23 21:04:07,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:04:07,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:04:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:04:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:04:07,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:04:07,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569982030] [2024-10-23 21:04:07,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569982030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:04:07,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:04:07,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:04:07,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124183098] [2024-10-23 21:04:07,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:04:07,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:04:07,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:04:07,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:04:07,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:04:07,957 INFO L87 Difference]: Start difference. First operand 1525 states and 1914 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:09,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:04:09,075 INFO L93 Difference]: Finished difference Result 4914 states and 6343 transitions. [2024-10-23 21:04:09,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:04:09,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 172 [2024-10-23 21:04:09,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:04:09,090 INFO L225 Difference]: With dead ends: 4914 [2024-10-23 21:04:09,091 INFO L226 Difference]: Without dead ends: 3574 [2024-10-23 21:04:09,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:04:09,094 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 316 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-23 21:04:09,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 88 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-23 21:04:09,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2024-10-23 21:04:09,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 3389. [2024-10-23 21:04:09,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3389 states, 3388 states have (on average 1.2564935064935066) internal successors, (4257), 3388 states have internal predecessors, (4257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:09,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3389 states to 3389 states and 4257 transitions. [2024-10-23 21:04:09,144 INFO L78 Accepts]: Start accepts. Automaton has 3389 states and 4257 transitions. Word has length 172 [2024-10-23 21:04:09,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:04:09,145 INFO L471 AbstractCegarLoop]: Abstraction has 3389 states and 4257 transitions. [2024-10-23 21:04:09,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:09,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3389 states and 4257 transitions. [2024-10-23 21:04:09,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-10-23 21:04:09,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:04:09,150 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2024-10-23 21:04:09,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 21:04:09,150 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:04:09,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:04:09,151 INFO L85 PathProgramCache]: Analyzing trace with hash -576393412, now seen corresponding path program 1 times [2024-10-23 21:04:09,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:04:09,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682094987] [2024-10-23 21:04:09,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:04:09,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:04:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:04:09,331 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-23 21:04:09,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:04:09,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682094987] [2024-10-23 21:04:09,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682094987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:04:09,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:04:09,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:04:09,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810331391] [2024-10-23 21:04:09,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:04:09,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:04:09,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:04:09,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:04:09,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:04:09,333 INFO L87 Difference]: Start difference. First operand 3389 states and 4257 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:09,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:04:09,953 INFO L93 Difference]: Finished difference Result 7704 states and 9813 transitions. [2024-10-23 21:04:09,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:04:09,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 227 [2024-10-23 21:04:09,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:04:09,965 INFO L225 Difference]: With dead ends: 7704 [2024-10-23 21:04:09,965 INFO L226 Difference]: Without dead ends: 4684 [2024-10-23 21:04:09,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:04:09,969 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 151 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:04:09,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 388 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:04:09,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4684 states. [2024-10-23 21:04:10,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4684 to 4677. [2024-10-23 21:04:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4677 states, 4676 states have (on average 1.2243370402053038) internal successors, (5725), 4676 states have internal predecessors, (5725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:10,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4677 states to 4677 states and 5725 transitions. [2024-10-23 21:04:10,024 INFO L78 Accepts]: Start accepts. Automaton has 4677 states and 5725 transitions. Word has length 227 [2024-10-23 21:04:10,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:04:10,025 INFO L471 AbstractCegarLoop]: Abstraction has 4677 states and 5725 transitions. [2024-10-23 21:04:10,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:10,025 INFO L276 IsEmpty]: Start isEmpty. Operand 4677 states and 5725 transitions. [2024-10-23 21:04:10,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-23 21:04:10,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:04:10,027 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:04:10,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-23 21:04:10,027 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:04:10,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:04:10,028 INFO L85 PathProgramCache]: Analyzing trace with hash -522045171, now seen corresponding path program 1 times [2024-10-23 21:04:10,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:04:10,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304752067] [2024-10-23 21:04:10,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:04:10,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:04:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:04:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-23 21:04:10,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:04:10,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304752067] [2024-10-23 21:04:10,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304752067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:04:10,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:04:10,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:04:10,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456260429] [2024-10-23 21:04:10,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:04:10,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:04:10,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:04:10,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:04:10,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:04:10,250 INFO L87 Difference]: Start difference. First operand 4677 states and 5725 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:10,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:04:10,924 INFO L93 Difference]: Finished difference Result 10648 states and 13139 transitions. [2024-10-23 21:04:10,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:04:10,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 233 [2024-10-23 21:04:10,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:04:10,943 INFO L225 Difference]: With dead ends: 10648 [2024-10-23 21:04:10,943 INFO L226 Difference]: Without dead ends: 6156 [2024-10-23 21:04:10,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:04:10,950 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 150 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:04:10,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 387 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:04:10,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6156 states. [2024-10-23 21:04:11,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6156 to 5964. [2024-10-23 21:04:11,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5964 states, 5963 states have (on average 1.2057689082676506) internal successors, (7190), 5963 states have internal predecessors, (7190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:11,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5964 states to 5964 states and 7190 transitions. [2024-10-23 21:04:11,030 INFO L78 Accepts]: Start accepts. Automaton has 5964 states and 7190 transitions. Word has length 233 [2024-10-23 21:04:11,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:04:11,031 INFO L471 AbstractCegarLoop]: Abstraction has 5964 states and 7190 transitions. [2024-10-23 21:04:11,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:11,031 INFO L276 IsEmpty]: Start isEmpty. Operand 5964 states and 7190 transitions. [2024-10-23 21:04:11,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-23 21:04:11,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:04:11,034 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:04:11,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-23 21:04:11,034 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:04:11,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:04:11,035 INFO L85 PathProgramCache]: Analyzing trace with hash 228339422, now seen corresponding path program 1 times [2024-10-23 21:04:11,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:04:11,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206732927] [2024-10-23 21:04:11,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:04:11,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:04:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:04:11,304 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-23 21:04:11,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:04:11,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206732927] [2024-10-23 21:04:11,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206732927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:04:11,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:04:11,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:04:11,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032492792] [2024-10-23 21:04:11,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:04:11,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:04:11,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:04:11,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:04:11,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:04:11,307 INFO L87 Difference]: Start difference. First operand 5964 states and 7190 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:11,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:04:11,880 INFO L93 Difference]: Finished difference Result 10816 states and 13129 transitions. [2024-10-23 21:04:11,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:04:11,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 239 [2024-10-23 21:04:11,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:04:11,895 INFO L225 Difference]: With dead ends: 10816 [2024-10-23 21:04:11,896 INFO L226 Difference]: Without dead ends: 5961 [2024-10-23 21:04:11,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:04:11,902 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 190 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:04:11,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 302 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:04:11,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5961 states. [2024-10-23 21:04:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5961 to 5960. [2024-10-23 21:04:11,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5960 states, 5959 states have (on average 1.1758684343010573) internal successors, (7007), 5959 states have internal predecessors, (7007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5960 states to 5960 states and 7007 transitions. [2024-10-23 21:04:11,981 INFO L78 Accepts]: Start accepts. Automaton has 5960 states and 7007 transitions. Word has length 239 [2024-10-23 21:04:11,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:04:11,982 INFO L471 AbstractCegarLoop]: Abstraction has 5960 states and 7007 transitions. [2024-10-23 21:04:11,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:11,982 INFO L276 IsEmpty]: Start isEmpty. Operand 5960 states and 7007 transitions. [2024-10-23 21:04:11,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2024-10-23 21:04:11,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:04:11,987 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:04:11,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-23 21:04:11,988 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:04:11,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:04:11,989 INFO L85 PathProgramCache]: Analyzing trace with hash -993326321, now seen corresponding path program 1 times [2024-10-23 21:04:11,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:04:11,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082942448] [2024-10-23 21:04:11,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:04:11,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:04:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:04:12,141 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-10-23 21:04:12,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:04:12,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082942448] [2024-10-23 21:04:12,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082942448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:04:12,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:04:12,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:04:12,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334412977] [2024-10-23 21:04:12,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:04:12,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:04:12,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:04:12,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:04:12,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:04:12,144 INFO L87 Difference]: Start difference. First operand 5960 states and 7007 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:12,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:04:12,821 INFO L93 Difference]: Finished difference Result 15604 states and 18405 transitions. [2024-10-23 21:04:12,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:04:12,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 310 [2024-10-23 21:04:12,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:04:12,846 INFO L225 Difference]: With dead ends: 15604 [2024-10-23 21:04:12,846 INFO L226 Difference]: Without dead ends: 10013 [2024-10-23 21:04:12,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:04:12,857 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 189 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:04:12,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 57 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:04:12,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10013 states. [2024-10-23 21:04:12,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10013 to 10008. [2024-10-23 21:04:12,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10008 states, 10007 states have (on average 1.1609873088837814) internal successors, (11618), 10007 states have internal predecessors, (11618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:12,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10008 states to 10008 states and 11618 transitions. [2024-10-23 21:04:12,986 INFO L78 Accepts]: Start accepts. Automaton has 10008 states and 11618 transitions. Word has length 310 [2024-10-23 21:04:12,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:04:12,987 INFO L471 AbstractCegarLoop]: Abstraction has 10008 states and 11618 transitions. [2024-10-23 21:04:12,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:12,987 INFO L276 IsEmpty]: Start isEmpty. Operand 10008 states and 11618 transitions. [2024-10-23 21:04:12,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-10-23 21:04:12,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:04:12,996 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:04:12,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-23 21:04:12,996 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:04:12,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:04:12,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1968393135, now seen corresponding path program 1 times [2024-10-23 21:04:12,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:04:12,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161684890] [2024-10-23 21:04:12,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:04:12,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:04:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:04:13,316 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:04:13,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:04:13,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161684890] [2024-10-23 21:04:13,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161684890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:04:13,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:04:13,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 21:04:13,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984693507] [2024-10-23 21:04:13,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:04:13,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:04:13,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:04:13,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:04:13,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:04:13,319 INFO L87 Difference]: Start difference. First operand 10008 states and 11618 transitions. Second operand has 4 states, 4 states have (on average 87.5) internal successors, (350), 4 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:04:14,396 INFO L93 Difference]: Finished difference Result 21852 states and 25482 transitions. [2024-10-23 21:04:14,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:04:14,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.5) internal successors, (350), 4 states have internal predecessors, (350), 0 states have call successors, (0), 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 350 [2024-10-23 21:04:14,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:04:14,428 INFO L225 Difference]: With dead ends: 21852 [2024-10-23 21:04:14,428 INFO L226 Difference]: Without dead ends: 13505 [2024-10-23 21:04:14,437 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-23 21:04:14,437 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 251 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-23 21:04:14,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 56 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-23 21:04:14,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13505 states. [2024-10-23 21:04:14,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13505 to 11846. [2024-10-23 21:04:14,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11846 states, 11845 states have (on average 1.1400590966652595) internal successors, (13504), 11845 states have internal predecessors, (13504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11846 states to 11846 states and 13504 transitions. [2024-10-23 21:04:14,579 INFO L78 Accepts]: Start accepts. Automaton has 11846 states and 13504 transitions. Word has length 350 [2024-10-23 21:04:14,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:04:14,579 INFO L471 AbstractCegarLoop]: Abstraction has 11846 states and 13504 transitions. [2024-10-23 21:04:14,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.5) internal successors, (350), 4 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:14,580 INFO L276 IsEmpty]: Start isEmpty. Operand 11846 states and 13504 transitions. [2024-10-23 21:04:14,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2024-10-23 21:04:14,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:04:14,595 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:04:14,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-23 21:04:14,596 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:04:14,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:04:14,596 INFO L85 PathProgramCache]: Analyzing trace with hash -748921188, now seen corresponding path program 1 times [2024-10-23 21:04:14,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:04:14,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571181212] [2024-10-23 21:04:14,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:04:14,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:04:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:04:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-23 21:04:15,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:04:15,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571181212] [2024-10-23 21:04:15,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571181212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:04:15,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:04:15,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 21:04:15,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579923497] [2024-10-23 21:04:15,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:04:15,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:04:15,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:04:15,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:04:15,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:04:15,033 INFO L87 Difference]: Start difference. First operand 11846 states and 13504 transitions. Second operand has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:15,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:04:15,986 INFO L93 Difference]: Finished difference Result 24058 states and 27471 transitions. [2024-10-23 21:04:15,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:04:15,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 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 424 [2024-10-23 21:04:15,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:04:16,008 INFO L225 Difference]: With dead ends: 24058 [2024-10-23 21:04:16,008 INFO L226 Difference]: Without dead ends: 13689 [2024-10-23 21:04:16,017 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-23 21:04:16,017 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 251 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-23 21:04:16,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 56 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-23 21:04:16,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13689 states. [2024-10-23 21:04:16,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13689 to 11478. [2024-10-23 21:04:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11478 states, 11477 states have (on average 1.1398449072057157) internal successors, (13082), 11477 states have internal predecessors, (13082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:16,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11478 states to 11478 states and 13082 transitions. [2024-10-23 21:04:16,144 INFO L78 Accepts]: Start accepts. Automaton has 11478 states and 13082 transitions. Word has length 424 [2024-10-23 21:04:16,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:04:16,145 INFO L471 AbstractCegarLoop]: Abstraction has 11478 states and 13082 transitions. [2024-10-23 21:04:16,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:16,145 INFO L276 IsEmpty]: Start isEmpty. Operand 11478 states and 13082 transitions. [2024-10-23 21:04:16,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2024-10-23 21:04:16,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:04:16,165 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:04:16,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-23 21:04:16,165 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:04:16,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:04:16,165 INFO L85 PathProgramCache]: Analyzing trace with hash 213494611, now seen corresponding path program 1 times [2024-10-23 21:04:16,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:04:16,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637840294] [2024-10-23 21:04:16,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:04:16,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:04:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:04:17,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 815 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2024-10-23 21:04:17,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:04:17,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637840294] [2024-10-23 21:04:17,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637840294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:04:17,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:04:17,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 21:04:17,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637096888] [2024-10-23 21:04:17,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:04:17,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-23 21:04:17,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:04:17,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-23 21:04:17,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-23 21:04:17,173 INFO L87 Difference]: Start difference. First operand 11478 states and 13082 transitions. Second operand has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 5 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:18,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:04:18,670 INFO L93 Difference]: Finished difference Result 23947 states and 27312 transitions. [2024-10-23 21:04:18,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-23 21:04:18,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 5 states have internal predecessors, (409), 0 states have call successors, (0), 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 657 [2024-10-23 21:04:18,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:04:18,689 INFO L225 Difference]: With dead ends: 23947 [2024-10-23 21:04:18,690 INFO L226 Difference]: Without dead ends: 12838 [2024-10-23 21:04:18,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-10-23 21:04:18,702 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 472 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 2116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-23 21:04:18,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 183 Invalid, 2116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1938 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-23 21:04:18,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12838 states. [2024-10-23 21:04:18,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12838 to 12767. [2024-10-23 21:04:18,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12767 states, 12766 states have (on average 1.1355162149459501) internal successors, (14496), 12766 states have internal predecessors, (14496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:18,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12767 states to 12767 states and 14496 transitions. [2024-10-23 21:04:18,853 INFO L78 Accepts]: Start accepts. Automaton has 12767 states and 14496 transitions. Word has length 657 [2024-10-23 21:04:18,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:04:18,854 INFO L471 AbstractCegarLoop]: Abstraction has 12767 states and 14496 transitions. [2024-10-23 21:04:18,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 5 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:18,854 INFO L276 IsEmpty]: Start isEmpty. Operand 12767 states and 14496 transitions. [2024-10-23 21:04:18,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2024-10-23 21:04:18,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:04:18,877 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:04:18,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-23 21:04:18,877 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:04:18,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:04:18,878 INFO L85 PathProgramCache]: Analyzing trace with hash -217044312, now seen corresponding path program 1 times [2024-10-23 21:04:18,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:04:18,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970156472] [2024-10-23 21:04:18,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:04:18,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:04:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:04:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 746 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2024-10-23 21:04:19,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:04:19,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970156472] [2024-10-23 21:04:19,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970156472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:04:19,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:04:19,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:04:19,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191420809] [2024-10-23 21:04:19,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:04:19,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:04:19,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:04:19,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:04:19,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:04:19,230 INFO L87 Difference]: Start difference. First operand 12767 states and 14496 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:19,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:04:19,870 INFO L93 Difference]: Finished difference Result 25160 states and 28618 transitions. [2024-10-23 21:04:19,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:04:19,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 688 [2024-10-23 21:04:19,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:04:19,871 INFO L225 Difference]: With dead ends: 25160 [2024-10-23 21:04:19,871 INFO L226 Difference]: Without dead ends: 0 [2024-10-23 21:04:19,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:04:19,883 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 196 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:04:19,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 346 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:04:19,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-23 21:04:19,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-23 21:04:19,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-23 21:04:19,884 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 688 [2024-10-23 21:04:19,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:04:19,884 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-23 21:04:19,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:04:19,885 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-23 21:04:19,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-23 21:04:19,887 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 21:04:19,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-23 21:04:19,890 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:04:19,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-23 21:04:20,691 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 21:04:20,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 09:04:20 BoogieIcfgContainer [2024-10-23 21:04:20,707 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 21:04:20,708 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 21:04:20,708 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 21:04:20,708 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 21:04:20,708 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:04:03" (3/4) ... [2024-10-23 21:04:20,710 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-23 21:04:20,732 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-23 21:04:20,732 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-23 21:04:20,733 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-23 21:04:20,734 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-23 21:04:20,882 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 21:04:20,882 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-23 21:04:20,882 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 21:04:20,883 INFO L158 Benchmark]: Toolchain (without parser) took 19343.22ms. Allocated memory was 180.4MB in the beginning and 666.9MB in the end (delta: 486.5MB). Free memory was 106.2MB in the beginning and 272.3MB in the end (delta: -166.1MB). Peak memory consumption was 321.6MB. Max. memory is 16.1GB. [2024-10-23 21:04:20,883 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 180.4MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 21:04:20,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 606.84ms. Allocated memory is still 180.4MB. Free memory was 106.0MB in the beginning and 116.7MB in the end (delta: -10.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-23 21:04:20,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.61ms. Allocated memory is still 180.4MB. Free memory was 116.7MB in the beginning and 98.7MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-23 21:04:20,885 INFO L158 Benchmark]: Boogie Preprocessor took 134.95ms. Allocated memory is still 180.4MB. Free memory was 98.7MB in the beginning and 73.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-23 21:04:20,886 INFO L158 Benchmark]: RCFGBuilder took 1460.69ms. Allocated memory was 180.4MB in the beginning and 289.4MB in the end (delta: 109.1MB). Free memory was 73.5MB in the beginning and 159.0MB in the end (delta: -85.5MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. [2024-10-23 21:04:20,886 INFO L158 Benchmark]: TraceAbstraction took 16864.27ms. Allocated memory was 289.4MB in the beginning and 666.9MB in the end (delta: 377.5MB). Free memory was 159.0MB in the beginning and 289.2MB in the end (delta: -130.2MB). Peak memory consumption was 351.1MB. Max. memory is 16.1GB. [2024-10-23 21:04:20,886 INFO L158 Benchmark]: Witness Printer took 174.53ms. Allocated memory is still 666.9MB. Free memory was 289.2MB in the beginning and 272.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-23 21:04:20,889 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.14ms. Allocated memory is still 180.4MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 606.84ms. Allocated memory is still 180.4MB. Free memory was 106.0MB in the beginning and 116.7MB in the end (delta: -10.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.61ms. Allocated memory is still 180.4MB. Free memory was 116.7MB in the beginning and 98.7MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 134.95ms. Allocated memory is still 180.4MB. Free memory was 98.7MB in the beginning and 73.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1460.69ms. Allocated memory was 180.4MB in the beginning and 289.4MB in the end (delta: 109.1MB). Free memory was 73.5MB in the beginning and 159.0MB in the end (delta: -85.5MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. * TraceAbstraction took 16864.27ms. Allocated memory was 289.4MB in the beginning and 666.9MB in the end (delta: 377.5MB). Free memory was 159.0MB in the beginning and 289.2MB in the end (delta: -130.2MB). Peak memory consumption was 351.1MB. Max. memory is 16.1GB. * Witness Printer took 174.53ms. Allocated memory is still 666.9MB. Free memory was 289.2MB in the beginning and 272.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 154]: 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, 221 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.0s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2732 SdHoareTripleChecker+Valid, 9.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2732 mSDsluCounter, 2830 SdHoareTripleChecker+Invalid, 8.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 364 mSDsCounter, 1656 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10004 IncrementalHoareTripleChecker+Invalid, 11660 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1656 mSolverCounterUnsat, 2466 mSDtfsCounter, 10004 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12767occurred in iteration=13, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 4343 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 3773 NumberOfCodeBlocks, 3773 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3759 ConstructedInterpolants, 0 QuantifiedInterpolants, 9930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 4210/4210 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: (((((((((((a4 == 0) && (a25 == 11)) && (a29 <= 599998)) && (a23 <= 312)) || (((a25 == 13) && (a29 <= 599998)) && (a4 == 1))) || ((a29 <= 277) && (a4 == 0))) || (((a25 == 11) && (a29 <= 599999)) && (a4 == 1))) || ((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 <= 10)) && (a29 <= 599998))) || (((a29 <= 599999) && (((long long) a23 + 599772) <= 0)) && (a4 == 1))) || ((a29 <= 277) && (a4 == 1))) || (((a25 <= 10) && (a29 <= 599999)) && (a4 == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-23 21:04:20,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE