./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label41.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label41.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 cd32d11e922bf190beba4edd20222f6e5b4dfc210b3394b8307f2a4d7f2efc9e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:11:23,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:11:23,947 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:11:23,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:11:23,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:11:23,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:11:23,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:11:23,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:11:23,979 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:11:23,980 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:11:23,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:11:23,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:11:23,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:11:23,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:11:23,982 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:11:23,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:11:23,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:11:23,983 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:11:23,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:11:23,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:11:23,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:11:23,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:11:23,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:11:23,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:11:23,985 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:11:23,985 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:11:23,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:11:23,985 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:11:23,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:11:23,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:11:23,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:11:23,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:11:23,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:11:23,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:11:23,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:11:23,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:11:23,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:11:23,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:11:23,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:11:23,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:11:23,988 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:11:23,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:11:23,990 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 -> cd32d11e922bf190beba4edd20222f6e5b4dfc210b3394b8307f2a4d7f2efc9e [2024-10-12 16:11:24,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:11:24,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:11:24,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:11:24,191 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:11:24,191 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:11:24,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label41.c [2024-10-12 16:11:25,445 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:11:25,851 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:11:25,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label41.c [2024-10-12 16:11:25,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de9aef0d5/28d3fc28e31c49f3aa3b6ce4351fb2fc/FLAGe9d6721fe [2024-10-12 16:11:25,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de9aef0d5/28d3fc28e31c49f3aa3b6ce4351fb2fc [2024-10-12 16:11:25,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:11:25,899 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:11:25,900 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:11:25,900 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:11:25,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:11:25,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:11:25" (1/1) ... [2024-10-12 16:11:25,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@506ab7ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:11:25, skipping insertion in model container [2024-10-12 16:11:25,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:11:25" (1/1) ... [2024-10-12 16:11:25,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:11:26,195 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label41.c[6347,6360] [2024-10-12 16:11:26,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:11:26,828 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:11:26,846 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label41.c[6347,6360] [2024-10-12 16:11:27,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:11:27,585 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:11:27,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:11:27 WrapperNode [2024-10-12 16:11:27,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:11:27,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:11:27,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:11:27,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:11:27,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:11:27" (1/1) ... [2024-10-12 16:11:27,698 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:11:27" (1/1) ... [2024-10-12 16:11:28,320 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-12 16:11:28,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:11:28,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:11:28,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:11:28,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:11:28,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:11:27" (1/1) ... [2024-10-12 16:11:28,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:11:27" (1/1) ... [2024-10-12 16:11:28,512 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:11:27" (1/1) ... [2024-10-12 16:11:28,778 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 16:11:28,779 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:11:27" (1/1) ... [2024-10-12 16:11:28,779 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:11:27" (1/1) ... [2024-10-12 16:11:28,955 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:11:27" (1/1) ... [2024-10-12 16:11:29,036 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:11:27" (1/1) ... [2024-10-12 16:11:29,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:11:27" (1/1) ... [2024-10-12 16:11:29,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:11:27" (1/1) ... [2024-10-12 16:11:29,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:11:29,126 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:11:29,126 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:11:29,126 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:11:29,127 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:11:27" (1/1) ... [2024-10-12 16:11:29,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:11:29,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:11:29,154 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 16:11:29,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 16:11:29,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:11:29,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:11:29,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:11:29,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:11:29,238 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:11:29,239 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:11:33,648 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-12 16:11:33,649 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:11:33,696 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:11:33,696 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:11:33,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:11:33 BoogieIcfgContainer [2024-10-12 16:11:33,697 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:11:33,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:11:33,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:11:33,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:11:33,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:11:25" (1/3) ... [2024-10-12 16:11:33,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef44af7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:11:33, skipping insertion in model container [2024-10-12 16:11:33,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:11:27" (2/3) ... [2024-10-12 16:11:33,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef44af7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:11:33, skipping insertion in model container [2024-10-12 16:11:33,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:11:33" (3/3) ... [2024-10-12 16:11:33,703 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label41.c [2024-10-12 16:11:33,715 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:11:33,715 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:11:33,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:11:33,793 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;@53607b66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:11:33,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:11:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:11:33,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 16:11:33,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:11:33,805 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:11:33,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:11:33,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:11:33,809 INFO L85 PathProgramCache]: Analyzing trace with hash -448622691, now seen corresponding path program 1 times [2024-10-12 16:11:33,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:11:33,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752474803] [2024-10-12 16:11:33,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:11:33,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:11:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:11:33,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:11:33,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:11:33,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752474803] [2024-10-12 16:11:33,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752474803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:11:33,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:11:33,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:11:33,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774572272] [2024-10-12 16:11:33,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:11:33,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:11:33,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:11:33,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:11:33,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:11:33,970 INFO L87 Difference]: Start difference. First operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:11:34,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:11:34,042 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-12 16:11:34,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:11:34,049 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-10-12 16:11:34,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:11:34,068 INFO L225 Difference]: With dead ends: 2071 [2024-10-12 16:11:34,069 INFO L226 Difference]: Without dead ends: 1034 [2024-10-12 16:11:34,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:11:34,080 INFO L432 NwaCegarLoop]: 1876 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:11:34,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1876 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:11:34,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-12 16:11:34,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-12 16:11:34,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:11:34,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-12 16:11:34,159 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 43 [2024-10-12 16:11:34,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:11:34,160 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-12 16:11:34,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:11:34,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-12 16:11:34,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 16:11:34,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:11:34,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:11:34,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:11:34,162 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:11:34,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:11:34,162 INFO L85 PathProgramCache]: Analyzing trace with hash -80918901, now seen corresponding path program 1 times [2024-10-12 16:11:34,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:11:34,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347224289] [2024-10-12 16:11:34,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:11:34,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:11:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:11:34,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:11:34,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:11:34,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347224289] [2024-10-12 16:11:34,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347224289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:11:34,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:11:34,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:11:34,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695504070] [2024-10-12 16:11:34,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:11:34,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:11:34,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:11:34,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:11:34,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:11:34,545 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:11:39,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:11:39,776 INFO L93 Difference]: Finished difference Result 3696 states and 6823 transitions. [2024-10-12 16:11:39,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:11:39,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-10-12 16:11:39,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:11:39,791 INFO L225 Difference]: With dead ends: 3696 [2024-10-12 16:11:39,791 INFO L226 Difference]: Without dead ends: 2663 [2024-10-12 16:11:39,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 16:11:39,794 INFO L432 NwaCegarLoop]: 717 mSDtfsCounter, 2674 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 4127 mSolverCounterSat, 1487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2674 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 5614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1487 IncrementalHoareTripleChecker+Valid, 4127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:11:39,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2674 Valid, 1017 Invalid, 5614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1487 Valid, 4127 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-10-12 16:11:39,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2024-10-12 16:11:39,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2662. [2024-10-12 16:11:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2662 states, 2661 states have (on average 1.4611048478015785) internal successors, (3888), 2661 states have internal predecessors, (3888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:11:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 3888 transitions. [2024-10-12 16:11:39,841 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 3888 transitions. Word has length 43 [2024-10-12 16:11:39,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:11:39,841 INFO L471 AbstractCegarLoop]: Abstraction has 2662 states and 3888 transitions. [2024-10-12 16:11:39,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:11:39,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 3888 transitions. [2024-10-12 16:11:39,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-12 16:11:39,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:11:39,850 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:11:39,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:11:39,850 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:11:39,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:11:39,851 INFO L85 PathProgramCache]: Analyzing trace with hash -484318780, now seen corresponding path program 1 times [2024-10-12 16:11:39,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:11:39,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580089971] [2024-10-12 16:11:39,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:11:39,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:11:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:11:40,101 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:11:40,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:11:40,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580089971] [2024-10-12 16:11:40,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580089971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:11:40,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:11:40,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:11:40,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313543360] [2024-10-12 16:11:40,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:11:40,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:11:40,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:11:40,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:11:40,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:11:40,104 INFO L87 Difference]: Start difference. First operand 2662 states and 3888 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:11:46,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:11:46,032 INFO L93 Difference]: Finished difference Result 7863 states and 12668 transitions. [2024-10-12 16:11:46,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:11:46,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2024-10-12 16:11:46,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:11:46,050 INFO L225 Difference]: With dead ends: 7863 [2024-10-12 16:11:46,050 INFO L226 Difference]: Without dead ends: 5989 [2024-10-12 16:11:46,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:11:46,055 INFO L432 NwaCegarLoop]: 892 mSDtfsCounter, 1712 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 5284 mSolverCounterSat, 843 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 6127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 843 IncrementalHoareTripleChecker+Valid, 5284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:11:46,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1712 Valid, 1066 Invalid, 6127 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [843 Valid, 5284 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-12 16:11:46,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2024-10-12 16:11:46,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 5858. [2024-10-12 16:11:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5858 states, 5857 states have (on average 1.4452791531500768) internal successors, (8465), 5857 states have internal predecessors, (8465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:11:46,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5858 states to 5858 states and 8465 transitions. [2024-10-12 16:11:46,152 INFO L78 Accepts]: Start accepts. Automaton has 5858 states and 8465 transitions. Word has length 168 [2024-10-12 16:11:46,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:11:46,155 INFO L471 AbstractCegarLoop]: Abstraction has 5858 states and 8465 transitions. [2024-10-12 16:11:46,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:11:46,155 INFO L276 IsEmpty]: Start isEmpty. Operand 5858 states and 8465 transitions. [2024-10-12 16:11:46,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-12 16:11:46,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:11:46,160 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:11:46,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:11:46,160 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:11:46,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:11:46,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1788785329, now seen corresponding path program 1 times [2024-10-12 16:11:46,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:11:46,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910599353] [2024-10-12 16:11:46,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:11:46,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:11:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:11:46,402 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-12 16:11:46,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:11:46,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910599353] [2024-10-12 16:11:46,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910599353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:11:46,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:11:46,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:11:46,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067248011] [2024-10-12 16:11:46,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:11:46,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:11:46,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:11:46,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:11:46,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:11:46,408 INFO L87 Difference]: Start difference. First operand 5858 states and 8465 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:11:49,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:11:49,442 INFO L93 Difference]: Finished difference Result 15686 states and 23389 transitions. [2024-10-12 16:11:49,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:11:49,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 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 210 [2024-10-12 16:11:49,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:11:49,491 INFO L225 Difference]: With dead ends: 15686 [2024-10-12 16:11:49,491 INFO L226 Difference]: Without dead ends: 10616 [2024-10-12 16:11:49,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:11:49,504 INFO L432 NwaCegarLoop]: 783 mSDtfsCounter, 919 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2555 mSolverCounterSat, 756 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 3311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 756 IncrementalHoareTripleChecker+Valid, 2555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:11:49,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 916 Invalid, 3311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [756 Valid, 2555 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-12 16:11:49,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10616 states. [2024-10-12 16:11:49,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10616 to 10607. [2024-10-12 16:11:49,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10607 states, 10606 states have (on average 1.3551763152932303) internal successors, (14373), 10606 states have internal predecessors, (14373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:11:49,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10607 states to 10607 states and 14373 transitions. [2024-10-12 16:11:49,654 INFO L78 Accepts]: Start accepts. Automaton has 10607 states and 14373 transitions. Word has length 210 [2024-10-12 16:11:49,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:11:49,655 INFO L471 AbstractCegarLoop]: Abstraction has 10607 states and 14373 transitions. [2024-10-12 16:11:49,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:11:49,656 INFO L276 IsEmpty]: Start isEmpty. Operand 10607 states and 14373 transitions. [2024-10-12 16:11:49,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-12 16:11:49,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:11:49,657 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-12 16:11:49,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:11:49,658 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:11:49,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:11:49,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1483555502, now seen corresponding path program 1 times [2024-10-12 16:11:49,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:11:49,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911058468] [2024-10-12 16:11:49,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:11:49,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:11:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:11:49,828 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-12 16:11:49,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:11:49,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911058468] [2024-10-12 16:11:49,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911058468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:11:49,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:11:49,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:11:49,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256423079] [2024-10-12 16:11:49,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:11:49,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:11:49,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:11:49,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:11:49,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:11:49,832 INFO L87 Difference]: Start difference. First operand 10607 states and 14373 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:11:53,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:11:53,235 INFO L93 Difference]: Finished difference Result 28350 states and 39239 transitions. [2024-10-12 16:11:53,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:11:53,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 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 224 [2024-10-12 16:11:53,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:11:53,283 INFO L225 Difference]: With dead ends: 28350 [2024-10-12 16:11:53,283 INFO L226 Difference]: Without dead ends: 18531 [2024-10-12 16:11:53,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:11:53,298 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 909 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 2873 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 3417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:11:53,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 611 Invalid, 3417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2873 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-12 16:11:53,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18531 states. [2024-10-12 16:11:53,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18531 to 18522. [2024-10-12 16:11:53,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18522 states, 18521 states have (on average 1.3251444306462934) internal successors, (24543), 18521 states have internal predecessors, (24543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:11:53,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18522 states to 18522 states and 24543 transitions. [2024-10-12 16:11:53,559 INFO L78 Accepts]: Start accepts. Automaton has 18522 states and 24543 transitions. Word has length 224 [2024-10-12 16:11:53,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:11:53,560 INFO L471 AbstractCegarLoop]: Abstraction has 18522 states and 24543 transitions. [2024-10-12 16:11:53,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:11:53,564 INFO L276 IsEmpty]: Start isEmpty. Operand 18522 states and 24543 transitions. [2024-10-12 16:11:53,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-12 16:11:53,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:11:53,570 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:11:53,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:11:53,570 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:11:53,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:11:53,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1595086689, now seen corresponding path program 1 times [2024-10-12 16:11:53,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:11:53,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379996763] [2024-10-12 16:11:53,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:11:53,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:11:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:11:53,732 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:11:53,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:11:53,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379996763] [2024-10-12 16:11:53,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379996763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:11:53,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:11:53,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:11:53,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595218040] [2024-10-12 16:11:53,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:11:53,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:11:53,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:11:53,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:11:53,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:11:53,735 INFO L87 Difference]: Start difference. First operand 18522 states and 24543 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:11:56,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:11:56,593 INFO L93 Difference]: Finished difference Result 52014 states and 69798 transitions. [2024-10-12 16:11:56,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:11:56,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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 242 [2024-10-12 16:11:56,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:11:56,678 INFO L225 Difference]: With dead ends: 52014 [2024-10-12 16:11:56,679 INFO L226 Difference]: Without dead ends: 34280 [2024-10-12 16:11:56,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:11:56,696 INFO L432 NwaCegarLoop]: 831 mSDtfsCounter, 851 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2394 mSolverCounterSat, 915 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 3309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 915 IncrementalHoareTripleChecker+Valid, 2394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:11:56,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 949 Invalid, 3309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [915 Valid, 2394 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 16:11:56,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34280 states. [2024-10-12 16:11:57,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34280 to 34270. [2024-10-12 16:11:57,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34270 states, 34269 states have (on average 1.255040999153754) internal successors, (43009), 34269 states have internal predecessors, (43009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:11:57,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34270 states to 34270 states and 43009 transitions. [2024-10-12 16:11:57,145 INFO L78 Accepts]: Start accepts. Automaton has 34270 states and 43009 transitions. Word has length 242 [2024-10-12 16:11:57,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:11:57,145 INFO L471 AbstractCegarLoop]: Abstraction has 34270 states and 43009 transitions. [2024-10-12 16:11:57,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:11:57,146 INFO L276 IsEmpty]: Start isEmpty. Operand 34270 states and 43009 transitions. [2024-10-12 16:11:57,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-10-12 16:11:57,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:11:57,151 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:11:57,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:11:57,151 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:11:57,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:11:57,152 INFO L85 PathProgramCache]: Analyzing trace with hash 870717412, now seen corresponding path program 1 times [2024-10-12 16:11:57,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:11:57,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945051575] [2024-10-12 16:11:57,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:11:57,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:11:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:11:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-12 16:11:57,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:11:57,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945051575] [2024-10-12 16:11:57,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945051575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:11:57,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:11:57,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:11:57,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849158787] [2024-10-12 16:11:57,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:11:57,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:11:57,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:11:57,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:11:57,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:11:57,383 INFO L87 Difference]: Start difference. First operand 34270 states and 43009 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:00,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:12:00,362 INFO L93 Difference]: Finished difference Result 92928 states and 117619 transitions. [2024-10-12 16:12:00,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:12:00,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 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 273 [2024-10-12 16:12:00,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:12:00,548 INFO L225 Difference]: With dead ends: 92928 [2024-10-12 16:12:00,548 INFO L226 Difference]: Without dead ends: 59446 [2024-10-12 16:12:00,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:12:00,615 INFO L432 NwaCegarLoop]: 837 mSDtfsCounter, 857 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 869 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 3178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 869 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:12:00,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 984 Invalid, 3178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [869 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 16:12:00,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59446 states. [2024-10-12 16:12:01,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59446 to 57868. [2024-10-12 16:12:01,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57868 states, 57867 states have (on average 1.1960530181277758) internal successors, (69212), 57867 states have internal predecessors, (69212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:01,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57868 states to 57868 states and 69212 transitions. [2024-10-12 16:12:01,256 INFO L78 Accepts]: Start accepts. Automaton has 57868 states and 69212 transitions. Word has length 273 [2024-10-12 16:12:01,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:12:01,257 INFO L471 AbstractCegarLoop]: Abstraction has 57868 states and 69212 transitions. [2024-10-12 16:12:01,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:01,257 INFO L276 IsEmpty]: Start isEmpty. Operand 57868 states and 69212 transitions. [2024-10-12 16:12:01,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2024-10-12 16:12:01,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:12:01,261 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:12:01,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:12:01,261 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:12:01,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:12:01,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1401958967, now seen corresponding path program 1 times [2024-10-12 16:12:01,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:12:01,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259937907] [2024-10-12 16:12:01,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:12:01,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:12:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:12:01,443 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-12 16:12:01,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:12:01,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259937907] [2024-10-12 16:12:01,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259937907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:12:01,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:12:01,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:12:01,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520972131] [2024-10-12 16:12:01,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:12:01,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:12:01,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:12:01,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:12:01,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:12:01,444 INFO L87 Difference]: Start difference. First operand 57868 states and 69212 transitions. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:07,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:12:07,792 INFO L93 Difference]: Finished difference Result 156095 states and 188758 transitions. [2024-10-12 16:12:07,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:12:07,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 311 [2024-10-12 16:12:07,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:12:07,914 INFO L225 Difference]: With dead ends: 156095 [2024-10-12 16:12:07,915 INFO L226 Difference]: Without dead ends: 99015 [2024-10-12 16:12:07,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:12:07,956 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 1732 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 6696 mSolverCounterSat, 1118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1732 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 7814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1118 IncrementalHoareTripleChecker+Valid, 6696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:12:07,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1732 Valid, 739 Invalid, 7814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1118 Valid, 6696 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-10-12 16:12:08,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99015 states. [2024-10-12 16:12:08,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99015 to 97313. [2024-10-12 16:12:08,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97313 states, 97312 states have (on average 1.1924531404143375) internal successors, (116040), 97312 states have internal predecessors, (116040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:09,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97313 states to 97313 states and 116040 transitions. [2024-10-12 16:12:09,548 INFO L78 Accepts]: Start accepts. Automaton has 97313 states and 116040 transitions. Word has length 311 [2024-10-12 16:12:09,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:12:09,548 INFO L471 AbstractCegarLoop]: Abstraction has 97313 states and 116040 transitions. [2024-10-12 16:12:09,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:09,549 INFO L276 IsEmpty]: Start isEmpty. Operand 97313 states and 116040 transitions. [2024-10-12 16:12:09,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-10-12 16:12:09,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:12:09,554 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:12:09,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:12:09,554 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:12:09,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:12:09,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1011036495, now seen corresponding path program 1 times [2024-10-12 16:12:09,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:12:09,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196071686] [2024-10-12 16:12:09,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:12:09,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:12:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:12:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-10-12 16:12:10,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:12:10,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196071686] [2024-10-12 16:12:10,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196071686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:12:10,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:12:10,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:12:10,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021128530] [2024-10-12 16:12:10,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:12:10,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:12:10,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:12:10,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:12:10,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:12:10,174 INFO L87 Difference]: Start difference. First operand 97313 states and 116040 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:13,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:12:13,342 INFO L93 Difference]: Finished difference Result 179672 states and 215981 transitions. [2024-10-12 16:12:13,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:12:13,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 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 326 [2024-10-12 16:12:13,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:12:13,593 INFO L225 Difference]: With dead ends: 179672 [2024-10-12 16:12:13,594 INFO L226 Difference]: Without dead ends: 97325 [2024-10-12 16:12:13,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:12:13,632 INFO L432 NwaCegarLoop]: 1019 mSDtfsCounter, 730 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 2707 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 2711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:12:13,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1200 Invalid, 2711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2707 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 16:12:13,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97325 states. [2024-10-12 16:12:14,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97325 to 97313. [2024-10-12 16:12:14,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97313 states, 97312 states have (on average 1.1915282801709963) internal successors, (115950), 97312 states have internal predecessors, (115950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:14,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97313 states to 97313 states and 115950 transitions. [2024-10-12 16:12:14,973 INFO L78 Accepts]: Start accepts. Automaton has 97313 states and 115950 transitions. Word has length 326 [2024-10-12 16:12:14,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:12:14,974 INFO L471 AbstractCegarLoop]: Abstraction has 97313 states and 115950 transitions. [2024-10-12 16:12:14,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:14,974 INFO L276 IsEmpty]: Start isEmpty. Operand 97313 states and 115950 transitions. [2024-10-12 16:12:14,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-10-12 16:12:14,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:12:14,978 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:12:14,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 16:12:14,978 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:12:14,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:12:14,978 INFO L85 PathProgramCache]: Analyzing trace with hash -120853801, now seen corresponding path program 1 times [2024-10-12 16:12:14,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:12:14,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743380151] [2024-10-12 16:12:14,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:12:14,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:12:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:12:16,248 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 227 proven. 110 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-12 16:12:16,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:12:16,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743380151] [2024-10-12 16:12:16,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743380151] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:12:16,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682423508] [2024-10-12 16:12:16,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:12:16,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:12:16,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:12:16,253 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:12:16,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 16:12:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:12:16,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:12:16,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:12:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-12 16:12:16,508 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:12:16,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682423508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:12:16,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:12:16,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-10-12 16:12:16,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991931884] [2024-10-12 16:12:16,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:12:16,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:12:16,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:12:16,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:12:16,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 16:12:16,510 INFO L87 Difference]: Start difference. First operand 97313 states and 115950 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:20,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:12:20,239 INFO L93 Difference]: Finished difference Result 193049 states and 229954 transitions. [2024-10-12 16:12:20,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:12:20,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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-10-12 16:12:20,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:12:20,503 INFO L225 Difference]: With dead ends: 193049 [2024-10-12 16:12:20,503 INFO L226 Difference]: Without dead ends: 96524 [2024-10-12 16:12:20,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 16:12:20,581 INFO L432 NwaCegarLoop]: 1364 mSDtfsCounter, 1138 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2468 mSolverCounterSat, 451 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 2919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 451 IncrementalHoareTripleChecker+Valid, 2468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:12:20,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 1445 Invalid, 2919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [451 Valid, 2468 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-12 16:12:20,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96524 states. [2024-10-12 16:12:21,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96524 to 96523. [2024-10-12 16:12:21,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96523 states, 96522 states have (on average 1.1407865564327304) internal successors, (110111), 96522 states have internal predecessors, (110111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:21,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96523 states to 96523 states and 110111 transitions. [2024-10-12 16:12:21,700 INFO L78 Accepts]: Start accepts. Automaton has 96523 states and 110111 transitions. Word has length 355 [2024-10-12 16:12:21,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:12:21,701 INFO L471 AbstractCegarLoop]: Abstraction has 96523 states and 110111 transitions. [2024-10-12 16:12:21,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:21,701 INFO L276 IsEmpty]: Start isEmpty. Operand 96523 states and 110111 transitions. [2024-10-12 16:12:21,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2024-10-12 16:12:21,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:12:21,712 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:12:21,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 16:12:21,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-12 16:12:21,914 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:12:21,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:12:21,915 INFO L85 PathProgramCache]: Analyzing trace with hash 819442625, now seen corresponding path program 1 times [2024-10-12 16:12:21,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:12:21,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730820563] [2024-10-12 16:12:21,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:12:21,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:12:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:12:22,062 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-12 16:12:22,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:12:22,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730820563] [2024-10-12 16:12:22,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730820563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:12:22,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:12:22,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:12:22,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518144458] [2024-10-12 16:12:22,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:12:22,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:12:22,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:12:22,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:12:22,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:12:22,065 INFO L87 Difference]: Start difference. First operand 96523 states and 110111 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:12:26,267 INFO L93 Difference]: Finished difference Result 192230 states and 219121 transitions. [2024-10-12 16:12:26,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:12:26,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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 360 [2024-10-12 16:12:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:12:26,393 INFO L225 Difference]: With dead ends: 192230 [2024-10-12 16:12:26,393 INFO L226 Difference]: Without dead ends: 96495 [2024-10-12 16:12:26,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:12:26,421 INFO L432 NwaCegarLoop]: 1501 mSDtfsCounter, 1035 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 2942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:12:26,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 1636 Invalid, 2942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-12 16:12:26,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96495 states. [2024-10-12 16:12:27,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96495 to 92550. [2024-10-12 16:12:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92550 states, 92549 states have (on average 1.0978076478406034) internal successors, (101601), 92549 states have internal predecessors, (101601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:27,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92550 states to 92550 states and 101601 transitions. [2024-10-12 16:12:27,547 INFO L78 Accepts]: Start accepts. Automaton has 92550 states and 101601 transitions. Word has length 360 [2024-10-12 16:12:27,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:12:27,547 INFO L471 AbstractCegarLoop]: Abstraction has 92550 states and 101601 transitions. [2024-10-12 16:12:27,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:27,547 INFO L276 IsEmpty]: Start isEmpty. Operand 92550 states and 101601 transitions. [2024-10-12 16:12:27,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2024-10-12 16:12:27,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:12:27,551 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:12:27,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 16:12:27,551 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:12:27,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:12:27,551 INFO L85 PathProgramCache]: Analyzing trace with hash -421260209, now seen corresponding path program 1 times [2024-10-12 16:12:27,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:12:27,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996575231] [2024-10-12 16:12:27,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:12:27,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:12:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:12:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-12 16:12:28,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:12:28,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996575231] [2024-10-12 16:12:28,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996575231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:12:28,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:12:28,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:12:28,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381604052] [2024-10-12 16:12:28,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:12:28,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:12:28,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:12:28,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:12:28,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:12:28,084 INFO L87 Difference]: Start difference. First operand 92550 states and 101601 transitions. Second operand has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:33,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:12:33,414 INFO L93 Difference]: Finished difference Result 203277 states and 225306 transitions. [2024-10-12 16:12:33,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:12:33,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 370 [2024-10-12 16:12:33,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:12:33,749 INFO L225 Difference]: With dead ends: 203277 [2024-10-12 16:12:33,749 INFO L226 Difference]: Without dead ends: 124904 [2024-10-12 16:12:33,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:12:33,786 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 1628 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 5245 mSolverCounterSat, 853 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 6098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 853 IncrementalHoareTripleChecker+Valid, 5245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:12:33,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1628 Valid, 869 Invalid, 6098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [853 Valid, 5245 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-10-12 16:12:33,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124904 states. [2024-10-12 16:12:34,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124904 to 109096. [2024-10-12 16:12:34,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109096 states, 109095 states have (on average 1.0896649708969246) internal successors, (118877), 109095 states have internal predecessors, (118877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:34,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109096 states to 109096 states and 118877 transitions. [2024-10-12 16:12:34,979 INFO L78 Accepts]: Start accepts. Automaton has 109096 states and 118877 transitions. Word has length 370 [2024-10-12 16:12:34,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:12:34,980 INFO L471 AbstractCegarLoop]: Abstraction has 109096 states and 118877 transitions. [2024-10-12 16:12:34,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:34,984 INFO L276 IsEmpty]: Start isEmpty. Operand 109096 states and 118877 transitions. [2024-10-12 16:12:34,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2024-10-12 16:12:34,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:12:34,991 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2024-10-12 16:12:34,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 16:12:34,992 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:12:34,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:12:34,992 INFO L85 PathProgramCache]: Analyzing trace with hash 10325705, now seen corresponding path program 1 times [2024-10-12 16:12:34,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:12:34,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540290085] [2024-10-12 16:12:34,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:12:34,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:12:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:12:35,592 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-10-12 16:12:35,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:12:35,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540290085] [2024-10-12 16:12:35,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540290085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:12:35,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:12:35,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:12:35,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723159267] [2024-10-12 16:12:35,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:12:35,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:12:35,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:12:35,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:12:35,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:12:35,595 INFO L87 Difference]: Start difference. First operand 109096 states and 118877 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:38,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:12:38,820 INFO L93 Difference]: Finished difference Result 253632 states and 275692 transitions. [2024-10-12 16:12:38,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:12:38,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 372 [2024-10-12 16:12:38,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:12:38,980 INFO L225 Difference]: With dead ends: 253632 [2024-10-12 16:12:38,980 INFO L226 Difference]: Without dead ends: 144537 [2024-10-12 16:12:39,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:12:39,040 INFO L432 NwaCegarLoop]: 1279 mSDtfsCounter, 1059 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 706 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 3178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 706 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:12:39,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 1328 Invalid, 3178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [706 Valid, 2472 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 16:12:39,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144537 states. [2024-10-12 16:12:40,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144537 to 136629. [2024-10-12 16:12:40,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136629 states, 136628 states have (on average 1.0781464999853616) internal successors, (147305), 136628 states have internal predecessors, (147305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136629 states to 136629 states and 147305 transitions. [2024-10-12 16:12:40,737 INFO L78 Accepts]: Start accepts. Automaton has 136629 states and 147305 transitions. Word has length 372 [2024-10-12 16:12:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:12:40,737 INFO L471 AbstractCegarLoop]: Abstraction has 136629 states and 147305 transitions. [2024-10-12 16:12:40,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:40,738 INFO L276 IsEmpty]: Start isEmpty. Operand 136629 states and 147305 transitions. [2024-10-12 16:12:40,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2024-10-12 16:12:40,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:12:40,744 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:12:40,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 16:12:40,744 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:12:40,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:12:40,745 INFO L85 PathProgramCache]: Analyzing trace with hash 179461806, now seen corresponding path program 1 times [2024-10-12 16:12:40,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:12:40,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118255730] [2024-10-12 16:12:40,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:12:40,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:12:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:12:42,812 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 390 proven. 110 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-12 16:12:42,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:12:42,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118255730] [2024-10-12 16:12:42,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118255730] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:12:42,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502489709] [2024-10-12 16:12:42,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:12:42,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:12:42,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:12:42,815 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:12:42,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 16:12:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:12:42,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 16:12:42,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:12:43,438 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-12 16:12:43,439 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:12:43,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502489709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:12:43,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:12:43,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-12 16:12:43,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276017702] [2024-10-12 16:12:43,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:12:43,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:12:43,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:12:43,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:12:43,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:12:43,441 INFO L87 Difference]: Start difference. First operand 136629 states and 147305 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:46,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:12:46,567 INFO L93 Difference]: Finished difference Result 266966 states and 288174 transitions. [2024-10-12 16:12:46,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:12:46,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 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 437 [2024-10-12 16:12:46,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:12:46,713 INFO L225 Difference]: With dead ends: 266966 [2024-10-12 16:12:46,713 INFO L226 Difference]: Without dead ends: 142940 [2024-10-12 16:12:46,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:12:46,768 INFO L432 NwaCegarLoop]: 1018 mSDtfsCounter, 685 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 2606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:12:46,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1151 Invalid, 2606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 2452 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 16:12:46,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142940 states. [2024-10-12 16:12:48,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142940 to 138994. [2024-10-12 16:12:48,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138994 states, 138993 states have (on average 1.0716079227011432) internal successors, (148946), 138993 states have internal predecessors, (148946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:48,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138994 states to 138994 states and 148946 transitions. [2024-10-12 16:12:48,580 INFO L78 Accepts]: Start accepts. Automaton has 138994 states and 148946 transitions. Word has length 437 [2024-10-12 16:12:48,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:12:48,581 INFO L471 AbstractCegarLoop]: Abstraction has 138994 states and 148946 transitions. [2024-10-12 16:12:48,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:48,581 INFO L276 IsEmpty]: Start isEmpty. Operand 138994 states and 148946 transitions. [2024-10-12 16:12:48,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2024-10-12 16:12:48,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:12:48,590 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:12:48,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 16:12:48,790 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-10-12 16:12:48,791 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:12:48,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:12:48,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1957568942, now seen corresponding path program 1 times [2024-10-12 16:12:48,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:12:48,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849078111] [2024-10-12 16:12:48,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:12:48,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:12:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:12:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-12 16:12:49,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:12:49,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849078111] [2024-10-12 16:12:49,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849078111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:12:49,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:12:49,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:12:49,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941011808] [2024-10-12 16:12:49,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:12:49,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:12:49,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:12:49,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:12:49,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:12:49,038 INFO L87 Difference]: Start difference. First operand 138994 states and 148946 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:12:53,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:12:53,484 INFO L93 Difference]: Finished difference Result 314206 states and 338432 transitions. [2024-10-12 16:12:53,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:12:53,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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 474 [2024-10-12 16:12:53,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:12:53,677 INFO L225 Difference]: With dead ends: 314206 [2024-10-12 16:12:53,678 INFO L226 Difference]: Without dead ends: 174426 [2024-10-12 16:12:53,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:12:53,716 INFO L432 NwaCegarLoop]: 1764 mSDtfsCounter, 736 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 2518 mSolverCounterSat, 588 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1909 SdHoareTripleChecker+Invalid, 3106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 588 IncrementalHoareTripleChecker+Valid, 2518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:12:53,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1909 Invalid, 3106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [588 Valid, 2518 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-12 16:12:53,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174426 states. [2024-10-12 16:12:55,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174426 to 171260.