./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label38.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label38.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 96ba89cb3a10a6781dfc1b6622655a925bd28641990009005f1ed4397d7ee8ac --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:54:48,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:54:48,950 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:54:48,954 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:54:48,955 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:54:48,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:54:48,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:54:48,987 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:54:48,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:54:48,989 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:54:48,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:54:48,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:54:48,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:54:48,992 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:54:48,992 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:54:48,993 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:54:48,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:54:48,993 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:54:48,993 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:54:48,994 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:54:48,994 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:54:48,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:54:48,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:54:48,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:54:48,998 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:54:48,999 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:54:48,999 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:54:48,999 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:54:49,000 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:54:49,000 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:54:49,000 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:54:49,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:54:49,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:54:49,001 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:54:49,001 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:54:49,001 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:54:49,002 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:54:49,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:54:49,002 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:54:49,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:54:49,003 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:54:49,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:54:49,003 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 -> 96ba89cb3a10a6781dfc1b6622655a925bd28641990009005f1ed4397d7ee8ac [2024-11-11 16:54:49,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:54:49,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:54:49,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:54:49,288 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:54:49,289 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:54:49,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label38.c [2024-11-11 16:54:50,678 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:54:51,165 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:54:51,167 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label38.c [2024-11-11 16:54:51,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a34bb77e3/155b41686d454d5e8ec39dd37f5c4997/FLAG77a0eb63e [2024-11-11 16:54:51,225 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a34bb77e3/155b41686d454d5e8ec39dd37f5c4997 [2024-11-11 16:54:51,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:54:51,230 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:54:51,232 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:54:51,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:54:51,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:54:51,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:54:51" (1/1) ... [2024-11-11 16:54:51,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51b2802b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:54:51, skipping insertion in model container [2024-11-11 16:54:51,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:54:51" (1/1) ... [2024-11-11 16:54:51,341 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:54:51,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label38.c[3304,3317] [2024-11-11 16:54:52,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:54:52,428 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:54:52,447 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label38.c[3304,3317] [2024-11-11 16:54:52,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:54:52,851 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:54:52,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:54:52 WrapperNode [2024-11-11 16:54:52,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:54:52,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:54:52,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:54:52,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:54:52,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:54:52" (1/1) ... [2024-11-11 16:54:52,944 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:54:52" (1/1) ... [2024-11-11 16:54:53,199 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-11-11 16:54:53,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:54:53,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:54:53,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:54:53,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:54:53,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:54:52" (1/1) ... [2024-11-11 16:54:53,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:54:52" (1/1) ... [2024-11-11 16:54:53,347 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:54:52" (1/1) ... [2024-11-11 16:54:53,482 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 16:54:53,483 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:54:52" (1/1) ... [2024-11-11 16:54:53,483 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:54:52" (1/1) ... [2024-11-11 16:54:53,638 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:54:52" (1/1) ... [2024-11-11 16:54:53,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:54:52" (1/1) ... [2024-11-11 16:54:53,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:54:52" (1/1) ... [2024-11-11 16:54:53,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:54:52" (1/1) ... [2024-11-11 16:54:53,788 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:54:53,789 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:54:53,790 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:54:53,790 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:54:53,791 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:54:52" (1/1) ... [2024-11-11 16:54:53,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:54:53,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:54:53,825 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 16:54:53,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 16:54:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:54:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:54:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:54:53,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:54:53,946 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:54:53,949 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:54:58,476 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-11-11 16:54:58,477 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:54:58,528 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:54:58,529 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 16:54:58,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:54:58 BoogieIcfgContainer [2024-11-11 16:54:58,530 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:54:58,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:54:58,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:54:58,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:54:58,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:54:51" (1/3) ... [2024-11-11 16:54:58,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241f053a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:54:58, skipping insertion in model container [2024-11-11 16:54:58,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:54:52" (2/3) ... [2024-11-11 16:54:58,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241f053a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:54:58, skipping insertion in model container [2024-11-11 16:54:58,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:54:58" (3/3) ... [2024-11-11 16:54:58,539 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label38.c [2024-11-11 16:54:58,556 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:54:58,556 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:54:58,652 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:54:58,661 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;@4035a1c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:54:58,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:54:58,672 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9178921568627452) internal successors, (1565), 817 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:54:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-11 16:54:58,679 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:54:58,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:54:58,681 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:54:58,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:54:58,688 INFO L85 PathProgramCache]: Analyzing trace with hash -593706766, now seen corresponding path program 1 times [2024-11-11 16:54:58,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:54:58,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528945331] [2024-11-11 16:54:58,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:54:58,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:54:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:54:58,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:54:58,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:54:58,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528945331] [2024-11-11 16:54:58,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528945331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:54:58,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:54:58,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:54:58,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484141361] [2024-11-11 16:54:58,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:54:59,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:54:59,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:54:59,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:54:59,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:54:59,026 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9178921568627452) internal successors, (1565), 817 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:02,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:55:02,341 INFO L93 Difference]: Finished difference Result 2388 states and 4629 transitions. [2024-11-11 16:55:02,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:55:02,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-11 16:55:02,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:55:02,372 INFO L225 Difference]: With dead ends: 2388 [2024-11-11 16:55:02,372 INFO L226 Difference]: Without dead ends: 1506 [2024-11-11 16:55:02,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:55:02,381 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 810 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-11 16:55:02,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 481 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-11 16:55:02,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2024-11-11 16:55:02,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2024-11-11 16:55:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.6385382059800664) internal successors, (2466), 1505 states have internal predecessors, (2466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:02,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2466 transitions. [2024-11-11 16:55:02,508 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2466 transitions. Word has length 24 [2024-11-11 16:55:02,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:55:02,509 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2466 transitions. [2024-11-11 16:55:02,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:02,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2466 transitions. [2024-11-11 16:55:02,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-11 16:55:02,512 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:55:02,512 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:55:02,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 16:55:02,513 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:55:02,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:55:02,514 INFO L85 PathProgramCache]: Analyzing trace with hash 317329089, now seen corresponding path program 1 times [2024-11-11 16:55:02,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:55:02,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612746242] [2024-11-11 16:55:02,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:55:02,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:55:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:55:02,931 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:55:02,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:55:02,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612746242] [2024-11-11 16:55:02,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612746242] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:55:02,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400187792] [2024-11-11 16:55:02,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:55:02,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:55:02,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:55:02,937 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:55:02,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 16:55:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:55:03,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:55:03,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:55:03,075 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:55:03,075 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:55:03,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400187792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:55:03,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:55:03,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-11 16:55:03,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517951638] [2024-11-11 16:55:03,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:55:03,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:55:03,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:55:03,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:55:03,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:55:03,081 INFO L87 Difference]: Start difference. First operand 1506 states and 2466 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:06,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:55:06,520 INFO L93 Difference]: Finished difference Result 4512 states and 7393 transitions. [2024-11-11 16:55:06,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:55:06,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-11 16:55:06,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:55:06,531 INFO L225 Difference]: With dead ends: 4512 [2024-11-11 16:55:06,532 INFO L226 Difference]: Without dead ends: 3008 [2024-11-11 16:55:06,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 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-11-11 16:55:06,535 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 776 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2197 mSolverCounterSat, 717 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 717 IncrementalHoareTripleChecker+Valid, 2197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:55:06,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 475 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [717 Valid, 2197 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-11 16:55:06,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2024-11-11 16:55:06,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3008. [2024-11-11 16:55:06,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.4253408713002993) internal successors, (4286), 3007 states have internal predecessors, (4286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4286 transitions. [2024-11-11 16:55:06,593 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4286 transitions. Word has length 95 [2024-11-11 16:55:06,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:55:06,594 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4286 transitions. [2024-11-11 16:55:06,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:06,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4286 transitions. [2024-11-11 16:55:06,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 16:55:06,596 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:55:06,596 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:55:06,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 16:55:06,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:55:06,801 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:55:06,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:55:06,801 INFO L85 PathProgramCache]: Analyzing trace with hash -99887689, now seen corresponding path program 1 times [2024-11-11 16:55:06,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:55:06,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083534135] [2024-11-11 16:55:06,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:55:06,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:55:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:55:06,955 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:55:06,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:55:06,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083534135] [2024-11-11 16:55:06,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083534135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:55:06,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:55:06,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:55:06,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042570594] [2024-11-11 16:55:06,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:55:06,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:55:06,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:55:06,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:55:06,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:55:06,958 INFO L87 Difference]: Start difference. First operand 3008 states and 4286 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:09,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:55:09,605 INFO L93 Difference]: Finished difference Result 9018 states and 12853 transitions. [2024-11-11 16:55:09,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:55:09,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-11-11 16:55:09,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:55:09,626 INFO L225 Difference]: With dead ends: 9018 [2024-11-11 16:55:09,626 INFO L226 Difference]: Without dead ends: 6012 [2024-11-11 16:55:09,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:55:09,635 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 774 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:55:09,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 448 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 16:55:09,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2024-11-11 16:55:09,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 6012. [2024-11-11 16:55:09,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6012 states, 6011 states have (on average 1.2947928797205124) internal successors, (7783), 6011 states have internal predecessors, (7783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:09,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 7783 transitions. [2024-11-11 16:55:09,760 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 7783 transitions. Word has length 99 [2024-11-11 16:55:09,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:55:09,761 INFO L471 AbstractCegarLoop]: Abstraction has 6012 states and 7783 transitions. [2024-11-11 16:55:09,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:09,762 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 7783 transitions. [2024-11-11 16:55:09,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-11 16:55:09,766 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:55:09,766 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:55:09,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 16:55:09,766 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:55:09,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:55:09,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1252232744, now seen corresponding path program 1 times [2024-11-11 16:55:09,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:55:09,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131786995] [2024-11-11 16:55:09,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:55:09,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:55:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:55:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:55:10,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:55:10,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131786995] [2024-11-11 16:55:10,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131786995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:55:10,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:55:10,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:55:10,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26550357] [2024-11-11 16:55:10,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:55:10,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 16:55:10,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:55:10,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 16:55:10,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:55:10,260 INFO L87 Difference]: Start difference. First operand 6012 states and 7783 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:15,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:55:15,225 INFO L93 Difference]: Finished difference Result 16528 states and 20628 transitions. [2024-11-11 16:55:15,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 16:55:15,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-11-11 16:55:15,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:55:15,253 INFO L225 Difference]: With dead ends: 16528 [2024-11-11 16:55:15,253 INFO L226 Difference]: Without dead ends: 10518 [2024-11-11 16:55:15,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:55:15,263 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 2900 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 6899 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2900 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 7159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 6899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:55:15,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2900 Valid, 729 Invalid, 7159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 6899 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-11 16:55:15,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10518 states. [2024-11-11 16:55:15,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10518 to 9767. [2024-11-11 16:55:15,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.2041777595740324) internal successors, (11760), 9766 states have internal predecessors, (11760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:15,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 11760 transitions. [2024-11-11 16:55:15,487 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 11760 transitions. Word has length 105 [2024-11-11 16:55:15,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:55:15,488 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 11760 transitions. [2024-11-11 16:55:15,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:15,489 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 11760 transitions. [2024-11-11 16:55:15,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-11 16:55:15,493 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:55:15,493 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:55:15,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 16:55:15,494 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:55:15,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:55:15,494 INFO L85 PathProgramCache]: Analyzing trace with hash -564744135, now seen corresponding path program 1 times [2024-11-11 16:55:15,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:55:15,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427164620] [2024-11-11 16:55:15,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:55:15,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:55:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:55:15,795 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:55:15,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:55:15,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427164620] [2024-11-11 16:55:15,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427164620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:55:15,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:55:15,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:55:15,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613578027] [2024-11-11 16:55:15,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:55:15,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:55:15,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:55:15,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:55:15,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:55:15,798 INFO L87 Difference]: Start difference. First operand 9767 states and 11760 transitions. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:18,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:55:18,905 INFO L93 Difference]: Finished difference Result 25577 states and 30217 transitions. [2024-11-11 16:55:18,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:55:18,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2024-11-11 16:55:18,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:55:18,946 INFO L225 Difference]: With dead ends: 25577 [2024-11-11 16:55:18,947 INFO L226 Difference]: Without dead ends: 15775 [2024-11-11 16:55:18,956 INFO L434 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-11-11 16:55:18,957 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 688 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3804 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 4011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 3804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:55:18,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 712 Invalid, 4011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 3804 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-11 16:55:18,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15775 states. [2024-11-11 16:55:19,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15775 to 13522. [2024-11-11 16:55:19,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13522 states, 13521 states have (on average 1.1523555950003699) internal successors, (15581), 13521 states have internal predecessors, (15581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:19,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13522 states to 13522 states and 15581 transitions. [2024-11-11 16:55:19,178 INFO L78 Accepts]: Start accepts. Automaton has 13522 states and 15581 transitions. Word has length 176 [2024-11-11 16:55:19,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:55:19,178 INFO L471 AbstractCegarLoop]: Abstraction has 13522 states and 15581 transitions. [2024-11-11 16:55:19,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:19,179 INFO L276 IsEmpty]: Start isEmpty. Operand 13522 states and 15581 transitions. [2024-11-11 16:55:19,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-11 16:55:19,182 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:55:19,182 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:55:19,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 16:55:19,182 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:55:19,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:55:19,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2051425434, now seen corresponding path program 1 times [2024-11-11 16:55:19,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:55:19,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136558676] [2024-11-11 16:55:19,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:55:19,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:55:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:55:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-11 16:55:19,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:55:19,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136558676] [2024-11-11 16:55:19,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136558676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:55:19,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:55:19,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:55:19,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516877099] [2024-11-11 16:55:19,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:55:19,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:55:19,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:55:19,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:55:19,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:55:19,405 INFO L87 Difference]: Start difference. First operand 13522 states and 15581 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:22,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:55:22,149 INFO L93 Difference]: Finished difference Result 35305 states and 41245 transitions. [2024-11-11 16:55:22,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:55:22,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 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 237 [2024-11-11 16:55:22,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:55:22,194 INFO L225 Difference]: With dead ends: 35305 [2024-11-11 16:55:22,194 INFO L226 Difference]: Without dead ends: 21785 [2024-11-11 16:55:22,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:55:22,213 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 848 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:55:22,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 310 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-11 16:55:22,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21785 states. [2024-11-11 16:55:22,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21785 to 21032. [2024-11-11 16:55:22,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21032 states, 21031 states have (on average 1.140554419666207) internal successors, (23987), 21031 states have internal predecessors, (23987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21032 states to 21032 states and 23987 transitions. [2024-11-11 16:55:22,534 INFO L78 Accepts]: Start accepts. Automaton has 21032 states and 23987 transitions. Word has length 237 [2024-11-11 16:55:22,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:55:22,535 INFO L471 AbstractCegarLoop]: Abstraction has 21032 states and 23987 transitions. [2024-11-11 16:55:22,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:22,536 INFO L276 IsEmpty]: Start isEmpty. Operand 21032 states and 23987 transitions. [2024-11-11 16:55:22,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-11 16:55:22,538 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:55:22,538 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:55:22,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 16:55:22,539 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:55:22,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:55:22,539 INFO L85 PathProgramCache]: Analyzing trace with hash 978903934, now seen corresponding path program 1 times [2024-11-11 16:55:22,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:55:22,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999833132] [2024-11-11 16:55:22,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:55:22,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:55:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:55:22,725 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:55:22,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:55:22,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999833132] [2024-11-11 16:55:22,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999833132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:55:22,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:55:22,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:55:22,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588029654] [2024-11-11 16:55:22,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:55:22,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:55:22,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:55:22,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:55:22,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:55:22,730 INFO L87 Difference]: Start difference. First operand 21032 states and 23987 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:25,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:55:25,557 INFO L93 Difference]: Finished difference Result 60086 states and 68807 transitions. [2024-11-11 16:55:25,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:55:25,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 250 [2024-11-11 16:55:25,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:55:25,626 INFO L225 Difference]: With dead ends: 60086 [2024-11-11 16:55:25,626 INFO L226 Difference]: Without dead ends: 39056 [2024-11-11 16:55:25,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:55:25,652 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 667 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2739 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 3104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 2739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:55:25,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1391 Invalid, 3104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 2739 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-11 16:55:25,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39056 states. [2024-11-11 16:55:26,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39056 to 35301. [2024-11-11 16:55:26,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35301 states, 35300 states have (on average 1.1373654390934844) internal successors, (40149), 35300 states have internal predecessors, (40149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:26,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35301 states to 35301 states and 40149 transitions. [2024-11-11 16:55:26,084 INFO L78 Accepts]: Start accepts. Automaton has 35301 states and 40149 transitions. Word has length 250 [2024-11-11 16:55:26,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:55:26,086 INFO L471 AbstractCegarLoop]: Abstraction has 35301 states and 40149 transitions. [2024-11-11 16:55:26,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:26,086 INFO L276 IsEmpty]: Start isEmpty. Operand 35301 states and 40149 transitions. [2024-11-11 16:55:26,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-11 16:55:26,093 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:55:26,093 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:55:26,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 16:55:26,093 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:55:26,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:55:26,094 INFO L85 PathProgramCache]: Analyzing trace with hash -500495800, now seen corresponding path program 1 times [2024-11-11 16:55:26,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:55:26,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838136141] [2024-11-11 16:55:26,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:55:26,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:55:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:55:26,350 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-11 16:55:26,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:55:26,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838136141] [2024-11-11 16:55:26,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838136141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:55:26,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:55:26,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:55:26,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205058333] [2024-11-11 16:55:26,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:55:26,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:55:26,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:55:26,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:55:26,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:55:26,353 INFO L87 Difference]: Start difference. First operand 35301 states and 40149 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:28,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:55:28,977 INFO L93 Difference]: Finished difference Result 70600 states and 80296 transitions. [2024-11-11 16:55:28,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:55:28,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 254 [2024-11-11 16:55:28,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:55:29,029 INFO L225 Difference]: With dead ends: 70600 [2024-11-11 16:55:29,030 INFO L226 Difference]: Without dead ends: 35301 [2024-11-11 16:55:29,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:55:29,059 INFO L435 NwaCegarLoop]: 991 mSDtfsCounter, 803 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 2709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:55:29,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 999 Invalid, 2709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 2313 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 16:55:29,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35301 states. [2024-11-11 16:55:29,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35301 to 35301. [2024-11-11 16:55:29,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35301 states, 35300 states have (on average 1.1111048158640227) internal successors, (39222), 35300 states have internal predecessors, (39222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35301 states to 35301 states and 39222 transitions. [2024-11-11 16:55:29,591 INFO L78 Accepts]: Start accepts. Automaton has 35301 states and 39222 transitions. Word has length 254 [2024-11-11 16:55:29,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:55:29,592 INFO L471 AbstractCegarLoop]: Abstraction has 35301 states and 39222 transitions. [2024-11-11 16:55:29,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:29,592 INFO L276 IsEmpty]: Start isEmpty. Operand 35301 states and 39222 transitions. [2024-11-11 16:55:29,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-11-11 16:55:29,597 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:55:29,598 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:55:29,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 16:55:29,598 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:55:29,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:55:29,599 INFO L85 PathProgramCache]: Analyzing trace with hash -763875920, now seen corresponding path program 1 times [2024-11-11 16:55:29,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:55:29,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305689157] [2024-11-11 16:55:29,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:55:29,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:55:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:55:29,809 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-11 16:55:29,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:55:29,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305689157] [2024-11-11 16:55:29,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305689157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:55:29,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:55:29,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:55:29,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733217527] [2024-11-11 16:55:29,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:55:29,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:55:29,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:55:29,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:55:29,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:55:29,815 INFO L87 Difference]: Start difference. First operand 35301 states and 39222 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:32,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:55:32,529 INFO L93 Difference]: Finished difference Result 88624 states and 99149 transitions. [2024-11-11 16:55:32,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:55:32,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 323 [2024-11-11 16:55:32,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:55:32,618 INFO L225 Difference]: With dead ends: 88624 [2024-11-11 16:55:32,618 INFO L226 Difference]: Without dead ends: 53325 [2024-11-11 16:55:32,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:55:32,662 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 792 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 732 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 2807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 732 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:55:32,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 238 Invalid, 2807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [732 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 16:55:32,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53325 states. [2024-11-11 16:55:33,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53325 to 53325. [2024-11-11 16:55:33,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53325 states, 53324 states have (on average 1.0945352936763935) internal successors, (58365), 53324 states have internal predecessors, (58365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:33,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53325 states to 53325 states and 58365 transitions. [2024-11-11 16:55:33,238 INFO L78 Accepts]: Start accepts. Automaton has 53325 states and 58365 transitions. Word has length 323 [2024-11-11 16:55:33,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:55:33,239 INFO L471 AbstractCegarLoop]: Abstraction has 53325 states and 58365 transitions. [2024-11-11 16:55:33,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand 53325 states and 58365 transitions. [2024-11-11 16:55:33,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-11-11 16:55:33,246 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:55:33,246 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:55:33,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 16:55:33,247 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:55:33,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:55:33,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1101173760, now seen corresponding path program 1 times [2024-11-11 16:55:33,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:55:33,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99335320] [2024-11-11 16:55:33,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:55:33,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:55:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:55:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-11-11 16:55:33,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:55:33,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99335320] [2024-11-11 16:55:33,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99335320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:55:33,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:55:33,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:55:33,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183910217] [2024-11-11 16:55:33,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:55:33,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:55:33,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:55:33,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:55:33,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:55:33,612 INFO L87 Difference]: Start difference. First operand 53325 states and 58365 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:36,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:55:36,286 INFO L93 Difference]: Finished difference Result 122419 states and 135492 transitions. [2024-11-11 16:55:36,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:55:36,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 355 [2024-11-11 16:55:36,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:55:36,366 INFO L225 Difference]: With dead ends: 122419 [2024-11-11 16:55:36,367 INFO L226 Difference]: Without dead ends: 66843 [2024-11-11 16:55:36,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:55:36,417 INFO L435 NwaCegarLoop]: 1307 mSDtfsCounter, 769 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 620 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 2854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 620 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:55:36,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1315 Invalid, 2854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [620 Valid, 2234 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 16:55:36,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66843 states. [2024-11-11 16:55:37,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66843 to 61586. [2024-11-11 16:55:37,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61586 states, 61585 states have (on average 1.0899894454818544) internal successors, (67127), 61585 states have internal predecessors, (67127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:37,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61586 states to 61586 states and 67127 transitions. [2024-11-11 16:55:37,166 INFO L78 Accepts]: Start accepts. Automaton has 61586 states and 67127 transitions. Word has length 355 [2024-11-11 16:55:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:55:37,167 INFO L471 AbstractCegarLoop]: Abstraction has 61586 states and 67127 transitions. [2024-11-11 16:55:37,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:37,167 INFO L276 IsEmpty]: Start isEmpty. Operand 61586 states and 67127 transitions. [2024-11-11 16:55:37,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2024-11-11 16:55:37,173 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:55:37,173 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:55:37,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 16:55:37,173 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:55:37,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:55:37,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1445249590, now seen corresponding path program 1 times [2024-11-11 16:55:37,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:55:37,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361315206] [2024-11-11 16:55:37,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:55:37,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:55:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:55:37,634 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-11 16:55:37,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:55:37,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361315206] [2024-11-11 16:55:37,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361315206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:55:37,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:55:37,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:55:37,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373457348] [2024-11-11 16:55:37,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:55:37,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:55:37,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:55:37,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:55:37,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:55:37,637 INFO L87 Difference]: Start difference. First operand 61586 states and 67127 transitions. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:40,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:55:40,411 INFO L93 Difference]: Finished difference Result 125423 states and 136549 transitions. [2024-11-11 16:55:40,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:55:40,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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 362 [2024-11-11 16:55:40,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:55:40,489 INFO L225 Difference]: With dead ends: 125423 [2024-11-11 16:55:40,490 INFO L226 Difference]: Without dead ends: 63839 [2024-11-11 16:55:40,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:55:40,655 INFO L435 NwaCegarLoop]: 1172 mSDtfsCounter, 738 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2080 mSolverCounterSat, 607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 2687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 607 IncrementalHoareTripleChecker+Valid, 2080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:55:40,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1179 Invalid, 2687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [607 Valid, 2080 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 16:55:40,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63839 states. [2024-11-11 16:55:41,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63839 to 62337. [2024-11-11 16:55:41,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62337 states, 62336 states have (on average 1.0605589065708418) internal successors, (66111), 62336 states have internal predecessors, (66111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:41,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62337 states to 62337 states and 66111 transitions. [2024-11-11 16:55:41,251 INFO L78 Accepts]: Start accepts. Automaton has 62337 states and 66111 transitions. Word has length 362 [2024-11-11 16:55:41,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:55:41,252 INFO L471 AbstractCegarLoop]: Abstraction has 62337 states and 66111 transitions. [2024-11-11 16:55:41,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:41,252 INFO L276 IsEmpty]: Start isEmpty. Operand 62337 states and 66111 transitions. [2024-11-11 16:55:41,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2024-11-11 16:55:41,257 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:55:41,257 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:55:41,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 16:55:41,257 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:55:41,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:55:41,258 INFO L85 PathProgramCache]: Analyzing trace with hash 45988282, now seen corresponding path program 1 times [2024-11-11 16:55:41,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:55:41,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779319002] [2024-11-11 16:55:41,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:55:41,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:55:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:55:41,763 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-11-11 16:55:41,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:55:41,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779319002] [2024-11-11 16:55:41,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779319002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:55:41,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:55:41,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:55:41,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37208989] [2024-11-11 16:55:41,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:55:41,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:55:41,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:55:41,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:55:41,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:55:41,767 INFO L87 Difference]: Start difference. First operand 62337 states and 66111 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:44,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:55:44,376 INFO L93 Difference]: Finished difference Result 138190 states and 146409 transitions. [2024-11-11 16:55:44,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:55:44,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 383 [2024-11-11 16:55:44,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:55:44,450 INFO L225 Difference]: With dead ends: 138190 [2024-11-11 16:55:44,450 INFO L226 Difference]: Without dead ends: 69847 [2024-11-11 16:55:44,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:55:44,479 INFO L435 NwaCegarLoop]: 1363 mSDtfsCounter, 748 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 2374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:55:44,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 1371 Invalid, 2374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 1981 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 16:55:44,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69847 states. [2024-11-11 16:55:45,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69847 to 60835. [2024-11-11 16:55:45,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60835 states, 60834 states have (on average 1.0526843541440642) internal successors, (64039), 60834 states have internal predecessors, (64039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:45,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60835 states to 60835 states and 64039 transitions. [2024-11-11 16:55:45,357 INFO L78 Accepts]: Start accepts. Automaton has 60835 states and 64039 transitions. Word has length 383 [2024-11-11 16:55:45,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:55:45,358 INFO L471 AbstractCegarLoop]: Abstraction has 60835 states and 64039 transitions. [2024-11-11 16:55:45,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:45,358 INFO L276 IsEmpty]: Start isEmpty. Operand 60835 states and 64039 transitions. [2024-11-11 16:55:45,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2024-11-11 16:55:45,365 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:55:45,366 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:55:45,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 16:55:45,366 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:55:45,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:55:45,367 INFO L85 PathProgramCache]: Analyzing trace with hash -389450428, now seen corresponding path program 1 times [2024-11-11 16:55:45,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:55:45,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804801484] [2024-11-11 16:55:45,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:55:45,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:55:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:55:45,960 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 16:55:45,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:55:45,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804801484] [2024-11-11 16:55:45,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804801484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:55:45,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:55:45,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:55:45,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457391547] [2024-11-11 16:55:45,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:55:45,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:55:45,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:55:45,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:55:45,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:55:45,964 INFO L87 Difference]: Start difference. First operand 60835 states and 64039 transitions. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:48,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:55:48,868 INFO L93 Difference]: Finished difference Result 149457 states and 158056 transitions. [2024-11-11 16:55:48,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:55:48,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 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 438 [2024-11-11 16:55:48,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:55:48,958 INFO L225 Difference]: With dead ends: 149457 [2024-11-11 16:55:48,958 INFO L226 Difference]: Without dead ends: 89375 [2024-11-11 16:55:48,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:55:48,993 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 716 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2284 mSolverCounterSat, 551 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 551 IncrementalHoareTripleChecker+Valid, 2284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:55:48,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 528 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [551 Valid, 2284 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-11 16:55:49,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89375 states. [2024-11-11 16:55:49,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89375 to 85618. [2024-11-11 16:55:49,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85618 states, 85617 states have (on average 1.0535641286193163) internal successors, (90203), 85617 states have internal predecessors, (90203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85618 states to 85618 states and 90203 transitions. [2024-11-11 16:55:50,099 INFO L78 Accepts]: Start accepts. Automaton has 85618 states and 90203 transitions. Word has length 438 [2024-11-11 16:55:50,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:55:50,100 INFO L471 AbstractCegarLoop]: Abstraction has 85618 states and 90203 transitions. [2024-11-11 16:55:50,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:50,100 INFO L276 IsEmpty]: Start isEmpty. Operand 85618 states and 90203 transitions. [2024-11-11 16:55:50,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2024-11-11 16:55:50,110 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:55:50,110 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:55:50,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 16:55:50,111 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:55:50,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:55:50,111 INFO L85 PathProgramCache]: Analyzing trace with hash 490250510, now seen corresponding path program 1 times [2024-11-11 16:55:50,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:55:50,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525832536] [2024-11-11 16:55:50,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:55:50,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:55:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:55:51,361 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 322 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:55:51,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:55:51,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525832536] [2024-11-11 16:55:51,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525832536] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:55:51,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174773430] [2024-11-11 16:55:51,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:55:51,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:55:51,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:55:51,364 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:55:51,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 16:55:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:55:51,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:55:51,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:55:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 16:55:51,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:55:51,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174773430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:55:51,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:55:51,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-11 16:55:51,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885174865] [2024-11-11 16:55:51,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:55:51,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:55:51,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:55:51,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:55:51,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:55:51,671 INFO L87 Difference]: Start difference. First operand 85618 states and 90203 transitions. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:54,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:55:54,751 INFO L93 Difference]: Finished difference Result 205780 states and 217316 transitions. [2024-11-11 16:55:54,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:55:54,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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 442 [2024-11-11 16:55:54,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:55:54,887 INFO L225 Difference]: With dead ends: 205780 [2024-11-11 16:55:54,887 INFO L226 Difference]: Without dead ends: 120915 [2024-11-11 16:55:54,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:55:54,910 INFO L435 NwaCegarLoop]: 1208 mSDtfsCounter, 693 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2401 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 2401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:55:54,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 1215 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 2401 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 16:55:54,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120915 states. [2024-11-11 16:55:56,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120915 to 114907. [2024-11-11 16:55:56,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114907 states, 114906 states have (on average 1.0537308756722887) internal successors, (121080), 114906 states have internal predecessors, (121080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:56,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114907 states to 114907 states and 121080 transitions. [2024-11-11 16:55:56,691 INFO L78 Accepts]: Start accepts. Automaton has 114907 states and 121080 transitions. Word has length 442 [2024-11-11 16:55:56,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:55:56,692 INFO L471 AbstractCegarLoop]: Abstraction has 114907 states and 121080 transitions. [2024-11-11 16:55:56,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:55:56,692 INFO L276 IsEmpty]: Start isEmpty. Operand 114907 states and 121080 transitions. [2024-11-11 16:55:56,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2024-11-11 16:55:56,707 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:55:56,707 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:55:56,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 16:55:56,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-11 16:55:56,908 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:55:56,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:55:56,909 INFO L85 PathProgramCache]: Analyzing trace with hash 19657173, now seen corresponding path program 1 times [2024-11-11 16:55:56,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:55:56,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418943543] [2024-11-11 16:55:56,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:55:56,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:55:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:55:57,288 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2024-11-11 16:55:57,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:55:57,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418943543] [2024-11-11 16:55:57,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418943543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:55:57,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:55:57,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:55:57,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412622189] [2024-11-11 16:55:57,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:55:57,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:55:57,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:55:57,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:55:57,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:55:57,292 INFO L87 Difference]: Start difference. First operand 114907 states and 121080 transitions. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:56:00,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:56:00,772 INFO L93 Difference]: Finished difference Result 253844 states and 268684 transitions. [2024-11-11 16:56:00,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:56:00,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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 536 [2024-11-11 16:56:00,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:56:00,942 INFO L225 Difference]: With dead ends: 253844 [2024-11-11 16:56:00,942 INFO L226 Difference]: Without dead ends: 139690 [2024-11-11 16:56:00,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:56:00,989 INFO L435 NwaCegarLoop]: 1237 mSDtfsCounter, 573 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2189 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 2500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 2189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:56:00,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 1245 Invalid, 2500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 2189 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-11 16:56:01,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139690 states. [2024-11-11 16:56:02,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139690 to 135935. [2024-11-11 16:56:02,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135935 states, 135934 states have (on average 1.0492150602498271) internal successors, (142624), 135934 states have internal predecessors, (142624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:56:03,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135935 states to 135935 states and 142624 transitions. [2024-11-11 16:56:03,053 INFO L78 Accepts]: Start accepts. Automaton has 135935 states and 142624 transitions. Word has length 536 [2024-11-11 16:56:03,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:56:03,054 INFO L471 AbstractCegarLoop]: Abstraction has 135935 states and 142624 transitions. [2024-11-11 16:56:03,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:56:03,054 INFO L276 IsEmpty]: Start isEmpty. Operand 135935 states and 142624 transitions. [2024-11-11 16:56:03,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2024-11-11 16:56:03,070 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:56:03,070 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:56:03,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 16:56:03,070 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:56:03,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:56:03,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1296899087, now seen corresponding path program 1 times [2024-11-11 16:56:03,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:56:03,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969786188] [2024-11-11 16:56:03,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:56:03,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:56:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:56:04,490 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-11 16:56:04,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:56:04,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969786188] [2024-11-11 16:56:04,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969786188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:56:04,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:56:04,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:56:04,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064838671] [2024-11-11 16:56:04,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:56:04,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:56:04,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:56:04,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:56:04,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:56:04,496 INFO L87 Difference]: Start difference. First operand 135935 states and 142624 transitions. Second operand has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)