./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/Problem19_label26.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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/Problem19_label26.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 4ebd5aed45c5461e176385745bb70c1ebeb4378f3074685fcb814a1b840527ca --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:39:53,747 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:39:53,803 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:39:53,808 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:39:53,809 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:39:53,828 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:39:53,829 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:39:53,829 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:39:53,830 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:39:53,830 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:39:53,830 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:39:53,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:39:53,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:39:53,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:39:53,832 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:39:53,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:39:53,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:39:53,832 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:39:53,833 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:39:53,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:39:53,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:39:53,834 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:39:53,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:39:53,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:39:53,834 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:39:53,835 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:39:53,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:39:53,835 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:39:53,835 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:39:53,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:39:53,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:39:53,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:39:53,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:39:53,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:39:53,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:39:53,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:39:53,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:39:53,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:39:53,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:39:53,838 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:39:53,838 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:39:53,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:39:53,839 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 -> 4ebd5aed45c5461e176385745bb70c1ebeb4378f3074685fcb814a1b840527ca [2024-10-12 16:39:53,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:39:54,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:39:54,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:39:54,018 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:39:54,019 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:39:54,019 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label26.c [2024-10-12 16:39:55,332 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:39:55,862 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:39:55,863 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label26.c [2024-10-12 16:39:55,900 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98aa798a8/a5e2570b6895462f8ff58569b608f1ce/FLAG1cf6b0606 [2024-10-12 16:39:55,918 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98aa798a8/a5e2570b6895462f8ff58569b608f1ce [2024-10-12 16:39:55,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:39:55,922 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:39:55,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:39:55,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:39:55,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:39:55,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:39:55" (1/1) ... [2024-10-12 16:39:55,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60097b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:39:55, skipping insertion in model container [2024-10-12 16:39:55,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:39:55" (1/1) ... [2024-10-12 16:39:56,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:39:56,285 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/Problem19_label26.c[3735,3748] [2024-10-12 16:39:57,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:39:57,374 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:39:57,387 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/Problem19_label26.c[3735,3748] [2024-10-12 16:39:57,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:39:57,989 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:39:57,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:39:57 WrapperNode [2024-10-12 16:39:57,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:39:57,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:39:57,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:39:57,991 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:39:57,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:39:57" (1/1) ... [2024-10-12 16:39:58,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:39:57" (1/1) ... [2024-10-12 16:39:58,703 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9431 [2024-10-12 16:39:58,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:39:58,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:39:58,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:39:58,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:39:58,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:39:57" (1/1) ... [2024-10-12 16:39:58,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:39:57" (1/1) ... [2024-10-12 16:39:58,915 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:39:57" (1/1) ... [2024-10-12 16:39:59,147 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-12 16:39:59,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:39:57" (1/1) ... [2024-10-12 16:39:59,148 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:39:57" (1/1) ... [2024-10-12 16:39:59,406 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:39:57" (1/1) ... [2024-10-12 16:39:59,436 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:39:57" (1/1) ... [2024-10-12 16:39:59,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:39:57" (1/1) ... [2024-10-12 16:39:59,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:39:57" (1/1) ... [2024-10-12 16:39:59,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:39:59,629 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:39:59,629 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:39:59,629 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:39:59,630 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:39:57" (1/1) ... [2024-10-12 16:39:59,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:39:59,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:39:59,654 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-12 16:39:59,656 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-12 16:39:59,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:39:59,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:39:59,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:39:59,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:39:59,749 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:39:59,751 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:40:06,386 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2024-10-12 16:40:06,386 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:40:06,476 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:40:06,477 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:40:06,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:40:06 BoogieIcfgContainer [2024-10-12 16:40:06,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:40:06,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:40:06,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:40:06,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:40:06,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:39:55" (1/3) ... [2024-10-12 16:40:06,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2edfdc8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:40:06, skipping insertion in model container [2024-10-12 16:40:06,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:39:57" (2/3) ... [2024-10-12 16:40:06,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2edfdc8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:40:06, skipping insertion in model container [2024-10-12 16:40:06,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:40:06" (3/3) ... [2024-10-12 16:40:06,484 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem19_label26.c [2024-10-12 16:40:06,497 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:40:06,497 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:40:06,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:40:06,585 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;@261da110, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:40:06,586 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:40:06,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 1686 states, 1684 states have (on average 1.902019002375297) internal successors, (3203), 1685 states have internal predecessors, (3203), 0 states have call successors, (0), 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-12 16:40:06,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 16:40:06,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:40:06,599 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] [2024-10-12 16:40:06,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:40:06,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:40:06,604 INFO L85 PathProgramCache]: Analyzing trace with hash -989768492, now seen corresponding path program 1 times [2024-10-12 16:40:06,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:40:06,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135614697] [2024-10-12 16:40:06,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:40:06,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:40:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:40:06,724 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-12 16:40:06,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:40:06,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135614697] [2024-10-12 16:40:06,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135614697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:40:06,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:40:06,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:40:06,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366356453] [2024-10-12 16:40:06,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:40:06,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:40:06,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:40:06,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:40:06,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:40:06,751 INFO L87 Difference]: Start difference. First operand has 1686 states, 1684 states have (on average 1.902019002375297) internal successors, (3203), 1685 states have internal predecessors, (3203), 0 states have call successors, (0), 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 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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-12 16:40:06,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:40:06,841 INFO L93 Difference]: Finished difference Result 3371 states and 6405 transitions. [2024-10-12 16:40:06,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:40:06,843 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-10-12 16:40:06,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:40:06,865 INFO L225 Difference]: With dead ends: 3371 [2024-10-12 16:40:06,865 INFO L226 Difference]: Without dead ends: 1684 [2024-10-12 16:40:06,874 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-12 16:40:06,878 INFO L432 NwaCegarLoop]: 3138 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, 3138 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-12 16:40:06,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3138 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:40:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2024-10-12 16:40:06,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2024-10-12 16:40:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.8645276292335116) internal successors, (3138), 1683 states have internal predecessors, (3138), 0 states have call successors, (0), 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-12 16:40:06,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 3138 transitions. [2024-10-12 16:40:06,987 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 3138 transitions. Word has length 25 [2024-10-12 16:40:06,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:40:06,991 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 3138 transitions. [2024-10-12 16:40:06,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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-12 16:40:06,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 3138 transitions. [2024-10-12 16:40:06,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 16:40:06,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:40:06,992 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] [2024-10-12 16:40:06,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:40:06,993 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:40:06,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:40:06,997 INFO L85 PathProgramCache]: Analyzing trace with hash 378612451, now seen corresponding path program 1 times [2024-10-12 16:40:06,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:40:06,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627862138] [2024-10-12 16:40:06,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:40:06,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:40:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:40:07,145 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-12 16:40:07,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:40:07,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627862138] [2024-10-12 16:40:07,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627862138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:40:07,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:40:07,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:40:07,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246265803] [2024-10-12 16:40:07,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:40:07,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:40:07,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:40:07,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:40:07,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:40:07,151 INFO L87 Difference]: Start difference. First operand 1684 states and 3138 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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-12 16:40:13,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:40:13,382 INFO L93 Difference]: Finished difference Result 4862 states and 9131 transitions. [2024-10-12 16:40:13,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:40:13,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-10-12 16:40:13,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:40:13,400 INFO L225 Difference]: With dead ends: 4862 [2024-10-12 16:40:13,404 INFO L226 Difference]: Without dead ends: 3179 [2024-10-12 16:40:13,408 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-12 16:40:13,410 INFO L432 NwaCegarLoop]: 975 mSDtfsCounter, 1622 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 4141 mSolverCounterSat, 2020 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1622 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 6161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2020 IncrementalHoareTripleChecker+Valid, 4141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:40:13,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1622 Valid, 1110 Invalid, 6161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2020 Valid, 4141 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-10-12 16:40:13,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2024-10-12 16:40:13,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 3121. [2024-10-12 16:40:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3121 states, 3120 states have (on average 1.728525641025641) internal successors, (5393), 3120 states have internal predecessors, (5393), 0 states have call successors, (0), 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-12 16:40:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 5393 transitions. [2024-10-12 16:40:13,469 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 5393 transitions. Word has length 25 [2024-10-12 16:40:13,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:40:13,470 INFO L471 AbstractCegarLoop]: Abstraction has 3121 states and 5393 transitions. [2024-10-12 16:40:13,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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-12 16:40:13,470 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 5393 transitions. [2024-10-12 16:40:13,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-12 16:40:13,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:40:13,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:40:13,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:40:13,474 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:40:13,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:40:13,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1422873151, now seen corresponding path program 1 times [2024-10-12 16:40:13,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:40:13,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514713164] [2024-10-12 16:40:13,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:40:13,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:40:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:40:13,641 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:40:13,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:40:13,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514713164] [2024-10-12 16:40:13,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514713164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:40:13,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:40:13,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:40:13,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928624805] [2024-10-12 16:40:13,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:40:13,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:40:13,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:40:13,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:40:13,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:40:13,644 INFO L87 Difference]: Start difference. First operand 3121 states and 5393 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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-12 16:40:19,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:40:19,711 INFO L93 Difference]: Finished difference Result 9134 states and 15859 transitions. [2024-10-12 16:40:19,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:40:19,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-10-12 16:40:19,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:40:19,730 INFO L225 Difference]: With dead ends: 9134 [2024-10-12 16:40:19,731 INFO L226 Difference]: Without dead ends: 6014 [2024-10-12 16:40:19,735 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-12 16:40:19,736 INFO L432 NwaCegarLoop]: 719 mSDtfsCounter, 2533 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 5119 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2533 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 5553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:40:19,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2533 Valid, 990 Invalid, 5553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5119 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-10-12 16:40:19,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2024-10-12 16:40:19,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 6012. [2024-10-12 16:40:19,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6012 states, 6011 states have (on average 1.6709366162036268) internal successors, (10044), 6011 states have internal predecessors, (10044), 0 states have call successors, (0), 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-12 16:40:19,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 10044 transitions. [2024-10-12 16:40:19,847 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 10044 transitions. Word has length 93 [2024-10-12 16:40:19,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:40:19,848 INFO L471 AbstractCegarLoop]: Abstraction has 6012 states and 10044 transitions. [2024-10-12 16:40:19,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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-12 16:40:19,848 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 10044 transitions. [2024-10-12 16:40:19,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 16:40:19,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:40:19,850 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:40:19,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:40:19,851 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:40:19,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:40:19,853 INFO L85 PathProgramCache]: Analyzing trace with hash 49676604, now seen corresponding path program 1 times [2024-10-12 16:40:19,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:40:19,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855247677] [2024-10-12 16:40:19,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:40:19,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:40:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:40:20,003 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:40:20,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:40:20,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855247677] [2024-10-12 16:40:20,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855247677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:40:20,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:40:20,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:40:20,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022844053] [2024-10-12 16:40:20,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:40:20,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:40:20,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:40:20,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:40:20,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:40:20,009 INFO L87 Difference]: Start difference. First operand 6012 states and 10044 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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-12 16:40:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:40:25,770 INFO L93 Difference]: Finished difference Result 17597 states and 29554 transitions. [2024-10-12 16:40:25,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:40:25,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 16:40:25,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:40:25,826 INFO L225 Difference]: With dead ends: 17597 [2024-10-12 16:40:25,827 INFO L226 Difference]: Without dead ends: 11586 [2024-10-12 16:40:25,841 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-12 16:40:25,848 INFO L432 NwaCegarLoop]: 1497 mSDtfsCounter, 1534 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 4336 mSolverCounterSat, 1470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 5806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1470 IncrementalHoareTripleChecker+Valid, 4336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:40:25,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 1716 Invalid, 5806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1470 Valid, 4336 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-10-12 16:40:25,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11586 states. [2024-10-12 16:40:26,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11586 to 11551. [2024-10-12 16:40:26,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11551 states, 11550 states have (on average 1.4577489177489178) internal successors, (16837), 11550 states have internal predecessors, (16837), 0 states have call successors, (0), 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-12 16:40:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11551 states to 11551 states and 16837 transitions. [2024-10-12 16:40:26,109 INFO L78 Accepts]: Start accepts. Automaton has 11551 states and 16837 transitions. Word has length 96 [2024-10-12 16:40:26,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:40:26,110 INFO L471 AbstractCegarLoop]: Abstraction has 11551 states and 16837 transitions. [2024-10-12 16:40:26,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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-12 16:40:26,110 INFO L276 IsEmpty]: Start isEmpty. Operand 11551 states and 16837 transitions. [2024-10-12 16:40:26,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 16:40:26,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:40:26,112 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:40:26,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:40:26,112 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:40:26,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:40:26,112 INFO L85 PathProgramCache]: Analyzing trace with hash 918498637, now seen corresponding path program 1 times [2024-10-12 16:40:26,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:40:26,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653466823] [2024-10-12 16:40:26,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:40:26,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:40:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:40:26,277 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:40:26,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:40:26,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653466823] [2024-10-12 16:40:26,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653466823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:40:26,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:40:26,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:40:26,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178292453] [2024-10-12 16:40:26,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:40:26,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:40:26,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:40:26,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:40:26,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:40:26,283 INFO L87 Difference]: Start difference. First operand 11551 states and 16837 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 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-12 16:40:32,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:40:32,002 INFO L93 Difference]: Finished difference Result 34261 states and 50006 transitions. [2024-10-12 16:40:32,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:40:32,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2024-10-12 16:40:32,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:40:32,039 INFO L225 Difference]: With dead ends: 34261 [2024-10-12 16:40:32,039 INFO L226 Difference]: Without dead ends: 22711 [2024-10-12 16:40:32,050 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-12 16:40:32,051 INFO L432 NwaCegarLoop]: 1848 mSDtfsCounter, 1750 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 4316 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1750 SdHoareTripleChecker+Valid, 2121 SdHoareTripleChecker+Invalid, 5746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:40:32,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1750 Valid, 2121 Invalid, 5746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4316 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-12 16:40:32,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22711 states. [2024-10-12 16:40:32,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22711 to 22686. [2024-10-12 16:40:32,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22686 states, 22685 states have (on average 1.281948424068768) internal successors, (29081), 22685 states have internal predecessors, (29081), 0 states have call successors, (0), 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-12 16:40:32,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22686 states to 22686 states and 29081 transitions. [2024-10-12 16:40:32,303 INFO L78 Accepts]: Start accepts. Automaton has 22686 states and 29081 transitions. Word has length 122 [2024-10-12 16:40:32,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:40:32,303 INFO L471 AbstractCegarLoop]: Abstraction has 22686 states and 29081 transitions. [2024-10-12 16:40:32,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 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-12 16:40:32,304 INFO L276 IsEmpty]: Start isEmpty. Operand 22686 states and 29081 transitions. [2024-10-12 16:40:32,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2024-10-12 16:40:32,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:40:32,308 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:40:32,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:40:32,308 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:40:32,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:40:32,309 INFO L85 PathProgramCache]: Analyzing trace with hash 940638309, now seen corresponding path program 1 times [2024-10-12 16:40:32,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:40:32,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783662727] [2024-10-12 16:40:32,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:40:32,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:40:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:40:33,285 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-12 16:40:33,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:40:33,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783662727] [2024-10-12 16:40:33,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783662727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:40:33,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:40:33,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:40:33,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774738551] [2024-10-12 16:40:33,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:40:33,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:40:33,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:40:33,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:40:33,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:40:33,289 INFO L87 Difference]: Start difference. First operand 22686 states and 29081 transitions. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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-12 16:40:41,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:40:41,092 INFO L93 Difference]: Finished difference Result 57743 states and 72060 transitions. [2024-10-12 16:40:41,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:40:41,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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 404 [2024-10-12 16:40:41,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:40:41,152 INFO L225 Difference]: With dead ends: 57743 [2024-10-12 16:40:41,153 INFO L226 Difference]: Without dead ends: 35058 [2024-10-12 16:40:41,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 16:40:41,179 INFO L432 NwaCegarLoop]: 1789 mSDtfsCounter, 3752 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 9617 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3752 SdHoareTripleChecker+Valid, 2146 SdHoareTripleChecker+Invalid, 9789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 9617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:40:41,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3752 Valid, 2146 Invalid, 9789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 9617 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-10-12 16:40:41,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35058 states. [2024-10-12 16:40:41,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35058 to 33648. [2024-10-12 16:40:41,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33648 states, 33647 states have (on average 1.2262608850714773) internal successors, (41260), 33647 states have internal predecessors, (41260), 0 states have call successors, (0), 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-12 16:40:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33648 states to 33648 states and 41260 transitions. [2024-10-12 16:40:41,622 INFO L78 Accepts]: Start accepts. Automaton has 33648 states and 41260 transitions. Word has length 404 [2024-10-12 16:40:41,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:40:41,623 INFO L471 AbstractCegarLoop]: Abstraction has 33648 states and 41260 transitions. [2024-10-12 16:40:41,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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-12 16:40:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 33648 states and 41260 transitions. [2024-10-12 16:40:41,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2024-10-12 16:40:41,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:40:41,633 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:40:41,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:40:41,633 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:40:41,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:40:41,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1200894984, now seen corresponding path program 1 times [2024-10-12 16:40:41,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:40:41,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577260178] [2024-10-12 16:40:41,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:40:41,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:40:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:40:42,659 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 388 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-10-12 16:40:42,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:40:42,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577260178] [2024-10-12 16:40:42,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577260178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:40:42,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:40:42,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:40:42,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980994064] [2024-10-12 16:40:42,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:40:42,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:40:42,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:40:42,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:40:42,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:40:42,663 INFO L87 Difference]: Start difference. First operand 33648 states and 41260 transitions. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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-12 16:40:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:40:50,871 INFO L93 Difference]: Finished difference Result 90599 states and 108577 transitions. [2024-10-12 16:40:50,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:40:50,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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 611 [2024-10-12 16:40:50,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:40:50,938 INFO L225 Difference]: With dead ends: 90599 [2024-10-12 16:40:50,939 INFO L226 Difference]: Without dead ends: 56952 [2024-10-12 16:40:50,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 16:40:50,976 INFO L432 NwaCegarLoop]: 1747 mSDtfsCounter, 3757 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 9353 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3757 SdHoareTripleChecker+Valid, 2099 SdHoareTripleChecker+Invalid, 9615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 9353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:40:50,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3757 Valid, 2099 Invalid, 9615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 9353 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2024-10-12 16:40:51,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56952 states. [2024-10-12 16:40:51,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56952 to 52813. [2024-10-12 16:40:51,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52813 states, 52812 states have (on average 1.1742028326895402) internal successors, (62012), 52812 states have internal predecessors, (62012), 0 states have call successors, (0), 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-12 16:40:51,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52813 states to 52813 states and 62012 transitions. [2024-10-12 16:40:51,716 INFO L78 Accepts]: Start accepts. Automaton has 52813 states and 62012 transitions. Word has length 611 [2024-10-12 16:40:51,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:40:51,717 INFO L471 AbstractCegarLoop]: Abstraction has 52813 states and 62012 transitions. [2024-10-12 16:40:51,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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-12 16:40:51,717 INFO L276 IsEmpty]: Start isEmpty. Operand 52813 states and 62012 transitions. [2024-10-12 16:40:51,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2024-10-12 16:40:51,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:40:51,733 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:40:51,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:40:51,734 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:40:51,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:40:51,734 INFO L85 PathProgramCache]: Analyzing trace with hash -741880866, now seen corresponding path program 1 times [2024-10-12 16:40:51,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:40:51,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122472141] [2024-10-12 16:40:51,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:40:51,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:40:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:40:52,549 INFO L134 CoverageAnalysis]: Checked inductivity of 608 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2024-10-12 16:40:52,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:40:52,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122472141] [2024-10-12 16:40:52,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122472141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:40:52,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:40:52,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:40:52,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799694165] [2024-10-12 16:40:52,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:40:52,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:40:52,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:40:52,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:40:52,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:40:52,552 INFO L87 Difference]: Start difference. First operand 52813 states and 62012 transitions. Second operand has 4 states, 4 states have (on average 120.75) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 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-12 16:40:57,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:40:57,767 INFO L93 Difference]: Finished difference Result 108386 states and 126802 transitions. [2024-10-12 16:40:57,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:40:57,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 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 639 [2024-10-12 16:40:57,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:40:57,835 INFO L225 Difference]: With dead ends: 108386 [2024-10-12 16:40:57,835 INFO L226 Difference]: Without dead ends: 55543 [2024-10-12 16:40:57,867 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-12 16:40:57,868 INFO L432 NwaCegarLoop]: 1766 mSDtfsCounter, 1151 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 5714 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 5722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:40:57,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1944 Invalid, 5722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 5714 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-12 16:40:57,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55543 states. [2024-10-12 16:40:58,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55543 to 55543. [2024-10-12 16:40:58,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55543 states, 55542 states have (on average 1.1657304382269273) internal successors, (64747), 55542 states have internal predecessors, (64747), 0 states have call successors, (0), 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-12 16:40:58,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55543 states to 55543 states and 64747 transitions. [2024-10-12 16:40:58,567 INFO L78 Accepts]: Start accepts. Automaton has 55543 states and 64747 transitions. Word has length 639 [2024-10-12 16:40:58,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:40:58,568 INFO L471 AbstractCegarLoop]: Abstraction has 55543 states and 64747 transitions. [2024-10-12 16:40:58,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 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-12 16:40:58,568 INFO L276 IsEmpty]: Start isEmpty. Operand 55543 states and 64747 transitions. [2024-10-12 16:40:58,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2024-10-12 16:40:58,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:40:58,573 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:40:58,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:40:58,573 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:40:58,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:40:58,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1805162235, now seen corresponding path program 1 times [2024-10-12 16:40:58,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:40:58,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828533346] [2024-10-12 16:40:58,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:40:58,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:40:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:40:59,238 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-10-12 16:40:59,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:40:59,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828533346] [2024-10-12 16:40:59,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828533346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:40:59,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:40:59,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:40:59,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126770480] [2024-10-12 16:40:59,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:40:59,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:40:59,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:40:59,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:40:59,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:40:59,246 INFO L87 Difference]: Start difference. First operand 55543 states and 64747 transitions. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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-12 16:41:05,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:41:05,809 INFO L93 Difference]: Finished difference Result 134342 states and 159875 transitions. [2024-10-12 16:41:05,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:41:05,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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 724 [2024-10-12 16:41:05,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:41:06,009 INFO L225 Difference]: With dead ends: 134342 [2024-10-12 16:41:06,012 INFO L226 Difference]: Without dead ends: 81530 [2024-10-12 16:41:06,073 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-12 16:41:06,076 INFO L432 NwaCegarLoop]: 3118 mSDtfsCounter, 1392 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 4624 mSolverCounterSat, 1160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1392 SdHoareTripleChecker+Valid, 3317 SdHoareTripleChecker+Invalid, 5784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1160 IncrementalHoareTripleChecker+Valid, 4624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:41:06,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1392 Valid, 3317 Invalid, 5784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1160 Valid, 4624 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-10-12 16:41:06,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81530 states. [2024-10-12 16:41:07,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81530 to 81512. [2024-10-12 16:41:07,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81512 states, 81511 states have (on average 1.133785624026205) internal successors, (92416), 81511 states have internal predecessors, (92416), 0 states have call successors, (0), 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-12 16:41:07,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81512 states to 81512 states and 92416 transitions. [2024-10-12 16:41:07,364 INFO L78 Accepts]: Start accepts. Automaton has 81512 states and 92416 transitions. Word has length 724 [2024-10-12 16:41:07,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:41:07,365 INFO L471 AbstractCegarLoop]: Abstraction has 81512 states and 92416 transitions. [2024-10-12 16:41:07,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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-12 16:41:07,365 INFO L276 IsEmpty]: Start isEmpty. Operand 81512 states and 92416 transitions. [2024-10-12 16:41:07,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2024-10-12 16:41:07,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:41:07,375 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:41:07,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 16:41:07,379 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:41:07,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:41:07,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1215316658, now seen corresponding path program 1 times [2024-10-12 16:41:07,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:41:07,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496211820] [2024-10-12 16:41:07,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:41:07,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:41:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:41:09,660 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 69 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:41:09,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:41:09,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496211820] [2024-10-12 16:41:09,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496211820] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:41:09,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503096505] [2024-10-12 16:41:09,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:41:09,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:41:09,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:41:09,669 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:41:09,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 16:41:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:41:09,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:41:09,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:41:09,980 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-10-12 16:41:09,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:41:09,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503096505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:41:09,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:41:09,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 16:41:09,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757831306] [2024-10-12 16:41:09,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:41:09,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:41:09,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:41:09,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:41:09,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:41:09,983 INFO L87 Difference]: Start difference. First operand 81512 states and 92416 transitions. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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-12 16:41:15,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:41:15,605 INFO L93 Difference]: Finished difference Result 202655 states and 232459 transitions. [2024-10-12 16:41:15,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:41:15,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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 731 [2024-10-12 16:41:15,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:41:15,746 INFO L225 Difference]: With dead ends: 202655 [2024-10-12 16:41:15,746 INFO L226 Difference]: Without dead ends: 123874 [2024-10-12 16:41:15,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 730 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:41:15,779 INFO L432 NwaCegarLoop]: 1564 mSDtfsCounter, 1532 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 5072 mSolverCounterSat, 996 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 6068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 996 IncrementalHoareTripleChecker+Valid, 5072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:41:15,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 1693 Invalid, 6068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [996 Valid, 5072 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-12 16:41:15,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123874 states. [2024-10-12 16:41:17,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123874 to 115647. [2024-10-12 16:41:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115647 states, 115646 states have (on average 1.1351278902858724) internal successors, (131273), 115646 states have internal predecessors, (131273), 0 states have call successors, (0), 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-12 16:41:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115647 states to 115647 states and 131273 transitions. [2024-10-12 16:41:17,321 INFO L78 Accepts]: Start accepts. Automaton has 115647 states and 131273 transitions. Word has length 731 [2024-10-12 16:41:17,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:41:17,322 INFO L471 AbstractCegarLoop]: Abstraction has 115647 states and 131273 transitions. [2024-10-12 16:41:17,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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-12 16:41:17,322 INFO L276 IsEmpty]: Start isEmpty. Operand 115647 states and 131273 transitions. [2024-10-12 16:41:17,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2024-10-12 16:41:17,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:41:17,335 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:41:17,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 16:41:17,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-12 16:41:17,537 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:41:17,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:41:17,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1568777247, now seen corresponding path program 1 times [2024-10-12 16:41:17,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:41:17,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442203019] [2024-10-12 16:41:17,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:41:17,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:41:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:41:18,151 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-10-12 16:41:18,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:41:18,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442203019] [2024-10-12 16:41:18,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442203019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:41:18,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:41:18,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:41:18,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077478556] [2024-10-12 16:41:18,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:41:18,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:41:18,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:41:18,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:41:18,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:41:18,154 INFO L87 Difference]: Start difference. First operand 115647 states and 131273 transitions. Second operand has 3 states, 3 states have (on average 196.0) internal successors, (588), 2 states have internal predecessors, (588), 0 states have call successors, (0), 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-12 16:41:23,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:41:23,721 INFO L93 Difference]: Finished difference Result 228572 states and 259827 transitions. [2024-10-12 16:41:23,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:41:23,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 196.0) internal successors, (588), 2 states have internal predecessors, (588), 0 states have call successors, (0), 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 842 [2024-10-12 16:41:23,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:41:23,874 INFO L225 Difference]: With dead ends: 228572 [2024-10-12 16:41:23,874 INFO L226 Difference]: Without dead ends: 115656 [2024-10-12 16:41:23,919 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-12 16:41:23,920 INFO L432 NwaCegarLoop]: 699 mSDtfsCounter, 1387 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 3925 mSolverCounterSat, 1378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1387 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 5303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1378 IncrementalHoareTripleChecker+Valid, 3925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:41:23,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1387 Valid, 749 Invalid, 5303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1378 Valid, 3925 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-12 16:41:23,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115656 states. [2024-10-12 16:41:25,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115656 to 115631. [2024-10-12 16:41:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115631 states, 115630 states have (on average 1.1117443570007783) internal successors, (128551), 115630 states have internal predecessors, (128551), 0 states have call successors, (0), 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-12 16:41:25,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115631 states to 115631 states and 128551 transitions. [2024-10-12 16:41:25,544 INFO L78 Accepts]: Start accepts. Automaton has 115631 states and 128551 transitions. Word has length 842 [2024-10-12 16:41:25,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:41:25,545 INFO L471 AbstractCegarLoop]: Abstraction has 115631 states and 128551 transitions. [2024-10-12 16:41:25,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.0) internal successors, (588), 2 states have internal predecessors, (588), 0 states have call successors, (0), 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-12 16:41:25,545 INFO L276 IsEmpty]: Start isEmpty. Operand 115631 states and 128551 transitions. [2024-10-12 16:41:25,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 885 [2024-10-12 16:41:25,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:41:25,551 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:41:25,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 16:41:25,551 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:41:25,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:41:25,552 INFO L85 PathProgramCache]: Analyzing trace with hash 851038670, now seen corresponding path program 1 times [2024-10-12 16:41:25,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:41:25,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434413657] [2024-10-12 16:41:25,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:41:25,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:41:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:41:27,073 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-10-12 16:41:27,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:41:27,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434413657] [2024-10-12 16:41:27,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434413657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:41:27,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:41:27,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:41:27,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749631611] [2024-10-12 16:41:27,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:41:27,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:41:27,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:41:27,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:41:27,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:41:27,080 INFO L87 Difference]: Start difference. First operand 115631 states and 128551 transitions. Second operand has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)