./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label22.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label22.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 782212e92ca4a15b07e81f4c0ca47da63585acb1e5a128bc81275e5c438e9fe1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:18:08,752 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:18:08,833 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:18:08,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:18:08,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:18:08,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:18:08,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:18:08,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:18:08,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:18:08,880 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:18:08,880 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:18:08,880 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:18:08,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:18:08,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:18:08,882 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:18:08,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:18:08,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:18:08,883 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:18:08,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:18:08,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:18:08,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:18:08,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:18:08,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:18:08,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:18:08,885 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:18:08,885 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:18:08,886 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:18:08,886 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:18:08,886 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:18:08,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:18:08,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:18:08,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:18:08,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:18:08,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:18:08,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:18:08,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:18:08,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:18:08,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:18:08,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:18:08,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:18:08,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:18:08,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:18:08,892 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 782212e92ca4a15b07e81f4c0ca47da63585acb1e5a128bc81275e5c438e9fe1 [2024-10-10 23:18:09,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:18:09,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:18:09,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:18:09,179 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:18:09,179 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:18:09,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label22.c [2024-10-10 23:18:10,653 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:18:10,947 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:18:10,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label22.c [2024-10-10 23:18:10,980 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b4960ced0/d2a6251756784f4eaf69c5086bbf7162/FLAGb2b5819c0 [2024-10-10 23:18:10,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b4960ced0/d2a6251756784f4eaf69c5086bbf7162 [2024-10-10 23:18:11,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:18:11,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:18:11,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:18:11,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:18:11,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:18:11,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:18:10" (1/1) ... [2024-10-10 23:18:11,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38532d73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11, skipping insertion in model container [2024-10-10 23:18:11,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:18:10" (1/1) ... [2024-10-10 23:18:11,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:18:11,308 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label22.c[8004,8017] [2024-10-10 23:18:11,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:18:11,542 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:18:11,582 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label22.c[8004,8017] [2024-10-10 23:18:11,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:18:11,839 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:18:11,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11 WrapperNode [2024-10-10 23:18:11,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:18:11,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:18:11,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:18:11,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:18:11,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11" (1/1) ... [2024-10-10 23:18:11,888 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11" (1/1) ... [2024-10-10 23:18:11,992 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-10-10 23:18:11,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:18:11,993 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:18:11,993 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:18:11,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:18:12,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11" (1/1) ... [2024-10-10 23:18:12,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11" (1/1) ... [2024-10-10 23:18:12,023 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11" (1/1) ... [2024-10-10 23:18:12,071 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:18:12,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11" (1/1) ... [2024-10-10 23:18:12,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11" (1/1) ... [2024-10-10 23:18:12,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11" (1/1) ... [2024-10-10 23:18:12,131 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11" (1/1) ... [2024-10-10 23:18:12,148 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11" (1/1) ... [2024-10-10 23:18:12,156 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11" (1/1) ... [2024-10-10 23:18:12,173 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:18:12,176 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:18:12,176 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:18:12,176 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:18:12,177 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11" (1/1) ... [2024-10-10 23:18:12,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:18:12,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:18:12,211 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:18:12,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:18:12,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:18:12,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:18:12,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:18:12,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:18:12,340 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:18:12,342 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:18:13,839 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-10 23:18:13,840 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:18:13,891 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:18:13,892 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:18:13,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:18:13 BoogieIcfgContainer [2024-10-10 23:18:13,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:18:13,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:18:13,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:18:13,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:18:13,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:18:10" (1/3) ... [2024-10-10 23:18:13,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3d31f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:18:13, skipping insertion in model container [2024-10-10 23:18:13,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:11" (2/3) ... [2024-10-10 23:18:13,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3d31f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:18:13, skipping insertion in model container [2024-10-10 23:18:13,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:18:13" (3/3) ... [2024-10-10 23:18:13,902 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label22.c [2024-10-10 23:18:13,918 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:18:13,919 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:18:13,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:18:14,003 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;@3a8fd893, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:18:14,004 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:18:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:14,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-10 23:18:14,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:14,026 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:14,026 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:14,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:14,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1831296511, now seen corresponding path program 1 times [2024-10-10 23:18:14,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:14,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417909892] [2024-10-10 23:18:14,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:14,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:14,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:14,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417909892] [2024-10-10 23:18:14,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417909892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:14,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:14,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:18:14,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50198190] [2024-10-10 23:18:14,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:14,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:18:14,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:14,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:18:14,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:18:14,290 INFO L87 Difference]: Start difference. First operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:14,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:14,338 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2024-10-10 23:18:14,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:18:14,341 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-10 23:18:14,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:14,352 INFO L225 Difference]: With dead ends: 441 [2024-10-10 23:18:14,352 INFO L226 Difference]: Without dead ends: 219 [2024-10-10 23:18:14,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:18:14,359 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:14,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:18:14,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-10 23:18:14,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-10 23:18:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:14,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2024-10-10 23:18:14,406 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 54 [2024-10-10 23:18:14,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:14,407 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2024-10-10 23:18:14,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:14,407 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2024-10-10 23:18:14,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-10 23:18:14,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:14,409 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:14,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:18:14,409 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:14,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:14,410 INFO L85 PathProgramCache]: Analyzing trace with hash 551995407, now seen corresponding path program 1 times [2024-10-10 23:18:14,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:14,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15540669] [2024-10-10 23:18:14,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:14,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:14,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:14,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:14,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15540669] [2024-10-10 23:18:14,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15540669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:14,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:14,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:18:14,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576960026] [2024-10-10 23:18:14,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:14,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:14,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:14,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:14,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:14,667 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:15,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:15,645 INFO L93 Difference]: Finished difference Result 630 states and 1026 transitions. [2024-10-10 23:18:15,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:15,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-10 23:18:15,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:15,649 INFO L225 Difference]: With dead ends: 630 [2024-10-10 23:18:15,650 INFO L226 Difference]: Without dead ends: 412 [2024-10-10 23:18:15,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:15,652 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 169 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:15,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 155 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:18:15,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-10 23:18:15,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2024-10-10 23:18:15,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.4549878345498783) internal successors, (598), 411 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:15,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 598 transitions. [2024-10-10 23:18:15,682 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 598 transitions. Word has length 54 [2024-10-10 23:18:15,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:15,682 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 598 transitions. [2024-10-10 23:18:15,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:15,683 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 598 transitions. [2024-10-10 23:18:15,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-10 23:18:15,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:15,691 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10 23:18:15,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:18:15,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:15,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:15,693 INFO L85 PathProgramCache]: Analyzing trace with hash 447208182, now seen corresponding path program 1 times [2024-10-10 23:18:15,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:15,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196364700] [2024-10-10 23:18:15,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:15,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:15,940 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:15,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:15,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196364700] [2024-10-10 23:18:15,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196364700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:15,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:15,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:18:15,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943933191] [2024-10-10 23:18:15,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:15,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:15,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:15,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:15,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:15,944 INFO L87 Difference]: Start difference. First operand 412 states and 598 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:16,712 INFO L93 Difference]: Finished difference Result 1210 states and 1762 transitions. [2024-10-10 23:18:16,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:16,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2024-10-10 23:18:16,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:16,716 INFO L225 Difference]: With dead ends: 1210 [2024-10-10 23:18:16,717 INFO L226 Difference]: Without dead ends: 799 [2024-10-10 23:18:16,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:16,720 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:16,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 118 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:16,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-10-10 23:18:16,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 788. [2024-10-10 23:18:16,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.3748411689961881) internal successors, (1082), 787 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:16,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1082 transitions. [2024-10-10 23:18:16,749 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1082 transitions. Word has length 122 [2024-10-10 23:18:16,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:16,750 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1082 transitions. [2024-10-10 23:18:16,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:16,750 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1082 transitions. [2024-10-10 23:18:16,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-10 23:18:16,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:16,754 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:16,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:18:16,755 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:16,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:16,756 INFO L85 PathProgramCache]: Analyzing trace with hash 500079035, now seen corresponding path program 1 times [2024-10-10 23:18:16,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:16,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362078391] [2024-10-10 23:18:16,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:16,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:17,099 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:17,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:17,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362078391] [2024-10-10 23:18:17,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362078391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:17,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:17,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:18:17,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701048821] [2024-10-10 23:18:17,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:17,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:17,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:17,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:17,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:17,105 INFO L87 Difference]: Start difference. First operand 788 states and 1082 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:17,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:17,783 INFO L93 Difference]: Finished difference Result 1944 states and 2611 transitions. [2024-10-10 23:18:17,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:17,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-10-10 23:18:17,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:17,789 INFO L225 Difference]: With dead ends: 1944 [2024-10-10 23:18:17,789 INFO L226 Difference]: Without dead ends: 1157 [2024-10-10 23:18:17,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:17,792 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:17,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 188 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:18:17,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-10-10 23:18:17,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2024-10-10 23:18:17,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.270995670995671) internal successors, (1468), 1155 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:17,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1468 transitions. [2024-10-10 23:18:17,823 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1468 transitions. Word has length 124 [2024-10-10 23:18:17,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:17,824 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1468 transitions. [2024-10-10 23:18:17,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:17,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1468 transitions. [2024-10-10 23:18:17,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-10 23:18:17,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:17,831 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:18:17,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:18:17,834 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:17,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:17,834 INFO L85 PathProgramCache]: Analyzing trace with hash 203254623, now seen corresponding path program 1 times [2024-10-10 23:18:17,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:17,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437758414] [2024-10-10 23:18:17,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:17,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:18,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:18,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437758414] [2024-10-10 23:18:18,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437758414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:18,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:18,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:18,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104965373] [2024-10-10 23:18:18,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:18,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:18,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:18,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:18,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:18,106 INFO L87 Difference]: Start difference. First operand 1156 states and 1468 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:18,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:18,853 INFO L93 Difference]: Finished difference Result 2518 states and 3348 transitions. [2024-10-10 23:18:18,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:18,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 181 [2024-10-10 23:18:18,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:18,861 INFO L225 Difference]: With dead ends: 2518 [2024-10-10 23:18:18,861 INFO L226 Difference]: Without dead ends: 1547 [2024-10-10 23:18:18,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:18,865 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 180 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:18,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 319 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:18,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2024-10-10 23:18:18,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1544. [2024-10-10 23:18:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1543 states have (on average 1.2935839274141283) internal successors, (1996), 1543 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1996 transitions. [2024-10-10 23:18:18,898 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1996 transitions. Word has length 181 [2024-10-10 23:18:18,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:18,899 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 1996 transitions. [2024-10-10 23:18:18,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:18,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1996 transitions. [2024-10-10 23:18:18,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-10 23:18:18,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:18,903 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:18,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:18:18,903 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:18,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:18,904 INFO L85 PathProgramCache]: Analyzing trace with hash -838952034, now seen corresponding path program 1 times [2024-10-10 23:18:18,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:18,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546167798] [2024-10-10 23:18:18,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:18,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:19,187 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-10 23:18:19,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:19,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546167798] [2024-10-10 23:18:19,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546167798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:19,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:19,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:19,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674043078] [2024-10-10 23:18:19,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:19,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:19,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:19,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:19,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:19,192 INFO L87 Difference]: Start difference. First operand 1544 states and 1996 transitions. Second operand has 3 states, 3 states have (on average 56.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-10 23:18:20,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:20,016 INFO L93 Difference]: Finished difference Result 3649 states and 4814 transitions. [2024-10-10 23:18:20,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:20,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.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 236 [2024-10-10 23:18:20,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:20,027 INFO L225 Difference]: With dead ends: 3649 [2024-10-10 23:18:20,028 INFO L226 Difference]: Without dead ends: 2290 [2024-10-10 23:18:20,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:20,063 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 142 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:20,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 389 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:18:20,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2024-10-10 23:18:20,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2097. [2024-10-10 23:18:20,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2097 states, 2096 states have (on average 1.2676526717557253) internal successors, (2657), 2096 states have internal predecessors, (2657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 2657 transitions. [2024-10-10 23:18:20,103 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 2657 transitions. Word has length 236 [2024-10-10 23:18:20,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:20,104 INFO L471 AbstractCegarLoop]: Abstraction has 2097 states and 2657 transitions. [2024-10-10 23:18:20,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.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-10 23:18:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 2657 transitions. [2024-10-10 23:18:20,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-10 23:18:20,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:20,110 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:20,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:18:20,110 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:20,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:20,111 INFO L85 PathProgramCache]: Analyzing trace with hash 44325293, now seen corresponding path program 1 times [2024-10-10 23:18:20,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:20,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483803003] [2024-10-10 23:18:20,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:20,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:20,683 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 91 proven. 14 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-10 23:18:20,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:20,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483803003] [2024-10-10 23:18:20,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483803003] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:18:20,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936607452] [2024-10-10 23:18:20,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:20,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:18:20,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:18:20,687 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:18:20,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:18:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:20,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:18:20,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:18:20,950 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-10 23:18:20,951 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:18:20,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936607452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:20,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:18:20,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:18:20,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510572226] [2024-10-10 23:18:20,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:20,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:20,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:20,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:20,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:18:20,953 INFO L87 Difference]: Start difference. First operand 2097 states and 2657 transitions. Second operand has 3 states, 3 states have (on average 56.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-10 23:18:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:21,809 INFO L93 Difference]: Finished difference Result 5670 states and 7286 transitions. [2024-10-10 23:18:21,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:21,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.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 242 [2024-10-10 23:18:21,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:21,827 INFO L225 Difference]: With dead ends: 5670 [2024-10-10 23:18:21,827 INFO L226 Difference]: Without dead ends: 3574 [2024-10-10 23:18:21,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:18:21,834 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 175 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:21,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 267 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:18:21,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2024-10-10 23:18:21,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 3571. [2024-10-10 23:18:21,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3571 states, 3570 states have (on average 1.2509803921568627) internal successors, (4466), 3570 states have internal predecessors, (4466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3571 states and 4466 transitions. [2024-10-10 23:18:21,939 INFO L78 Accepts]: Start accepts. Automaton has 3571 states and 4466 transitions. Word has length 242 [2024-10-10 23:18:21,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:21,939 INFO L471 AbstractCegarLoop]: Abstraction has 3571 states and 4466 transitions. [2024-10-10 23:18:21,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.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-10 23:18:21,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3571 states and 4466 transitions. [2024-10-10 23:18:21,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-10-10 23:18:21,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:21,944 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:21,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:18:22,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:18:22,149 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:22,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:22,150 INFO L85 PathProgramCache]: Analyzing trace with hash 269088157, now seen corresponding path program 1 times [2024-10-10 23:18:22,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:22,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809443030] [2024-10-10 23:18:22,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:22,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:22,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:22,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809443030] [2024-10-10 23:18:22,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809443030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:22,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:22,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:22,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800991015] [2024-10-10 23:18:22,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:22,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:18:22,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:22,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:18:22,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:18:22,431 INFO L87 Difference]: Start difference. First operand 3571 states and 4466 transitions. Second operand has 4 states, 4 states have (on average 70.25) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:23,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:23,708 INFO L93 Difference]: Finished difference Result 11412 states and 14583 transitions. [2024-10-10 23:18:23,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:18:23,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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 281 [2024-10-10 23:18:23,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:23,736 INFO L225 Difference]: With dead ends: 11412 [2024-10-10 23:18:23,736 INFO L226 Difference]: Without dead ends: 8026 [2024-10-10 23:18:23,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:18:23,744 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 261 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:23,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 93 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:18:23,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8026 states. [2024-10-10 23:18:23,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8026 to 8024. [2024-10-10 23:18:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8024 states, 8023 states have (on average 1.2535211267605635) internal successors, (10057), 8023 states have internal predecessors, (10057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:23,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8024 states to 8024 states and 10057 transitions. [2024-10-10 23:18:23,907 INFO L78 Accepts]: Start accepts. Automaton has 8024 states and 10057 transitions. Word has length 281 [2024-10-10 23:18:23,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:23,907 INFO L471 AbstractCegarLoop]: Abstraction has 8024 states and 10057 transitions. [2024-10-10 23:18:23,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 8024 states and 10057 transitions. [2024-10-10 23:18:23,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2024-10-10 23:18:23,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:23,915 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:23,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:18:23,915 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:23,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:23,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1578186549, now seen corresponding path program 1 times [2024-10-10 23:18:23,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:23,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495067430] [2024-10-10 23:18:23,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:23,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:24,194 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-10 23:18:24,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:24,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495067430] [2024-10-10 23:18:24,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495067430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:24,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:24,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:24,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733529624] [2024-10-10 23:18:24,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:24,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:24,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:24,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:24,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:24,201 INFO L87 Difference]: Start difference. First operand 8024 states and 10057 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:25,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:25,032 INFO L93 Difference]: Finished difference Result 18084 states and 22878 transitions. [2024-10-10 23:18:25,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:25,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 290 [2024-10-10 23:18:25,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:25,068 INFO L225 Difference]: With dead ends: 18084 [2024-10-10 23:18:25,068 INFO L226 Difference]: Without dead ends: 10245 [2024-10-10 23:18:25,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:25,083 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 141 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:25,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 381 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:25,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10245 states. [2024-10-10 23:18:25,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10245 to 10231. [2024-10-10 23:18:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10231 states, 10230 states have (on average 1.221407624633431) internal successors, (12495), 10230 states have internal predecessors, (12495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10231 states to 10231 states and 12495 transitions. [2024-10-10 23:18:25,273 INFO L78 Accepts]: Start accepts. Automaton has 10231 states and 12495 transitions. Word has length 290 [2024-10-10 23:18:25,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:25,274 INFO L471 AbstractCegarLoop]: Abstraction has 10231 states and 12495 transitions. [2024-10-10 23:18:25,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:25,275 INFO L276 IsEmpty]: Start isEmpty. Operand 10231 states and 12495 transitions. [2024-10-10 23:18:25,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-10-10 23:18:25,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:25,285 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:25,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:18:25,286 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:25,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:25,287 INFO L85 PathProgramCache]: Analyzing trace with hash 380915456, now seen corresponding path program 1 times [2024-10-10 23:18:25,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:25,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044581779] [2024-10-10 23:18:25,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:25,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:26,083 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 173 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:26,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:26,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044581779] [2024-10-10 23:18:26,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044581779] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:18:26,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999732851] [2024-10-10 23:18:26,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:26,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:18:26,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:18:26,086 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:18:26,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:18:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:26,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-10 23:18:26,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:18:27,824 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 173 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:27,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:18:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 173 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:29,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999732851] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:18:29,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:18:29,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-10 23:18:29,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644291947] [2024-10-10 23:18:29,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:18:29,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-10 23:18:29,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:29,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-10 23:18:29,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:18:29,975 INFO L87 Difference]: Start difference. First operand 10231 states and 12495 transitions. Second operand has 8 states, 8 states have (on average 72.375) internal successors, (579), 7 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:32,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:32,416 INFO L93 Difference]: Finished difference Result 23640 states and 29104 transitions. [2024-10-10 23:18:32,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-10 23:18:32,417 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 72.375) internal successors, (579), 7 states have internal predecessors, (579), 0 states have call successors, (0), 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 328 [2024-10-10 23:18:32,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:32,444 INFO L225 Difference]: With dead ends: 23640 [2024-10-10 23:18:32,445 INFO L226 Difference]: Without dead ends: 14147 [2024-10-10 23:18:32,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 652 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-10-10 23:18:32,458 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 1003 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 2539 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 2969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 2539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:32,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 163 Invalid, 2969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 2539 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:18:32,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14147 states. [2024-10-10 23:18:32,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14147 to 10942. [2024-10-10 23:18:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10942 states, 10941 states have (on average 1.1883740060323553) internal successors, (13002), 10941 states have internal predecessors, (13002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:32,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10942 states to 10942 states and 13002 transitions. [2024-10-10 23:18:32,637 INFO L78 Accepts]: Start accepts. Automaton has 10942 states and 13002 transitions. Word has length 328 [2024-10-10 23:18:32,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:32,638 INFO L471 AbstractCegarLoop]: Abstraction has 10942 states and 13002 transitions. [2024-10-10 23:18:32,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 72.375) internal successors, (579), 7 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:32,639 INFO L276 IsEmpty]: Start isEmpty. Operand 10942 states and 13002 transitions. [2024-10-10 23:18:32,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-10-10 23:18:32,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:32,652 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:32,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:18:32,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:18:32,857 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:32,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:32,857 INFO L85 PathProgramCache]: Analyzing trace with hash 334582650, now seen corresponding path program 1 times [2024-10-10 23:18:32,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:32,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263522587] [2024-10-10 23:18:32,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:32,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:33,236 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 367 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-10 23:18:33,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:33,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263522587] [2024-10-10 23:18:33,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263522587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:33,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:33,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:33,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898550552] [2024-10-10 23:18:33,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:33,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:33,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:33,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:33,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:33,242 INFO L87 Difference]: Start difference. First operand 10942 states and 13002 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:33,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:33,892 INFO L93 Difference]: Finished difference Result 27056 states and 32310 transitions. [2024-10-10 23:18:33,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:33,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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 348 [2024-10-10 23:18:33,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:33,924 INFO L225 Difference]: With dead ends: 27056 [2024-10-10 23:18:33,924 INFO L226 Difference]: Without dead ends: 16851 [2024-10-10 23:18:33,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:33,940 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 138 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:33,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 139 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:18:33,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16851 states. [2024-10-10 23:18:34,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16851 to 16847. [2024-10-10 23:18:34,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16847 states, 16846 states have (on average 1.1673987890300368) internal successors, (19666), 16846 states have internal predecessors, (19666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16847 states to 16847 states and 19666 transitions. [2024-10-10 23:18:34,179 INFO L78 Accepts]: Start accepts. Automaton has 16847 states and 19666 transitions. Word has length 348 [2024-10-10 23:18:34,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:34,180 INFO L471 AbstractCegarLoop]: Abstraction has 16847 states and 19666 transitions. [2024-10-10 23:18:34,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:34,180 INFO L276 IsEmpty]: Start isEmpty. Operand 16847 states and 19666 transitions. [2024-10-10 23:18:34,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2024-10-10 23:18:34,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:34,196 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:34,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:18:34,196 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:34,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:34,197 INFO L85 PathProgramCache]: Analyzing trace with hash -88118321, now seen corresponding path program 1 times [2024-10-10 23:18:34,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:34,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196979423] [2024-10-10 23:18:34,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:34,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:34,594 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:34,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:34,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196979423] [2024-10-10 23:18:34,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196979423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:34,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:34,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:34,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616655446] [2024-10-10 23:18:34,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:34,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:34,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:34,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:34,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:34,598 INFO L87 Difference]: Start difference. First operand 16847 states and 19666 transitions. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:35,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:35,327 INFO L93 Difference]: Finished difference Result 35909 states and 41956 transitions. [2024-10-10 23:18:35,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:35,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 356 [2024-10-10 23:18:35,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:35,368 INFO L225 Difference]: With dead ends: 35909 [2024-10-10 23:18:35,368 INFO L226 Difference]: Without dead ends: 20167 [2024-10-10 23:18:35,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:35,390 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 57 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:35,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 73 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:18:35,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20167 states. [2024-10-10 23:18:35,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20167 to 20159. [2024-10-10 23:18:35,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20159 states, 20158 states have (on average 1.1559678539537652) internal successors, (23302), 20158 states have internal predecessors, (23302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:35,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20159 states to 20159 states and 23302 transitions. [2024-10-10 23:18:35,736 INFO L78 Accepts]: Start accepts. Automaton has 20159 states and 23302 transitions. Word has length 356 [2024-10-10 23:18:35,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:35,737 INFO L471 AbstractCegarLoop]: Abstraction has 20159 states and 23302 transitions. [2024-10-10 23:18:35,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:35,737 INFO L276 IsEmpty]: Start isEmpty. Operand 20159 states and 23302 transitions. [2024-10-10 23:18:35,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-10-10 23:18:35,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:35,752 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:35,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:18:35,753 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:35,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:35,753 INFO L85 PathProgramCache]: Analyzing trace with hash 750913683, now seen corresponding path program 1 times [2024-10-10 23:18:35,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:35,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257063995] [2024-10-10 23:18:35,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:35,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:36,167 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-10 23:18:36,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:36,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257063995] [2024-10-10 23:18:36,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257063995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:36,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:36,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:36,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129104720] [2024-10-10 23:18:36,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:36,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:18:36,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:36,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:18:36,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:18:36,169 INFO L87 Difference]: Start difference. First operand 20159 states and 23302 transitions. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:37,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:37,322 INFO L93 Difference]: Finished difference Result 44217 states and 51654 transitions. [2024-10-10 23:18:37,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:18:37,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 358 [2024-10-10 23:18:37,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:37,355 INFO L225 Difference]: With dead ends: 44217 [2024-10-10 23:18:37,355 INFO L226 Difference]: Without dead ends: 26085 [2024-10-10 23:18:37,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:18:37,376 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 259 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:37,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 99 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:18:37,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26085 states. [2024-10-10 23:18:37,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26085 to 22200. [2024-10-10 23:18:37,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22200 states, 22199 states have (on average 1.1554124059642326) internal successors, (25649), 22199 states have internal predecessors, (25649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:37,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22200 states to 22200 states and 25649 transitions. [2024-10-10 23:18:37,655 INFO L78 Accepts]: Start accepts. Automaton has 22200 states and 25649 transitions. Word has length 358 [2024-10-10 23:18:37,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:37,655 INFO L471 AbstractCegarLoop]: Abstraction has 22200 states and 25649 transitions. [2024-10-10 23:18:37,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:37,656 INFO L276 IsEmpty]: Start isEmpty. Operand 22200 states and 25649 transitions. [2024-10-10 23:18:37,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-10-10 23:18:37,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:37,718 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:37,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:18:37,718 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:37,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:37,719 INFO L85 PathProgramCache]: Analyzing trace with hash 895292363, now seen corresponding path program 1 times [2024-10-10 23:18:37,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:37,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241566386] [2024-10-10 23:18:37,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:37,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:38,688 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-10-10 23:18:38,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:38,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241566386] [2024-10-10 23:18:38,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241566386] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:18:38,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100620580] [2024-10-10 23:18:38,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:38,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:18:38,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:18:38,691 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:18:38,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:18:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:38,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:18:38,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:18:39,439 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-10-10 23:18:39,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:18:42,883 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-10-10 23:18:42,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100620580] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:18:42,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:18:42,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-10-10 23:18:42,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096808882] [2024-10-10 23:18:42,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:42,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:18:42,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:42,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:18:42,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:18:42,890 INFO L87 Difference]: Start difference. First operand 22200 states and 25649 transitions. Second operand has 4 states, 4 states have (on average 54.5) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:44,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:44,247 INFO L93 Difference]: Finished difference Result 50702 states and 59094 transitions. [2024-10-10 23:18:44,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:18:44,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 359 [2024-10-10 23:18:44,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:44,286 INFO L225 Difference]: With dead ends: 50702 [2024-10-10 23:18:44,286 INFO L226 Difference]: Without dead ends: 30529 [2024-10-10 23:18:44,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 714 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:18:44,300 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 238 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:44,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 201 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:18:44,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30529 states. [2024-10-10 23:18:44,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30529 to 22752. [2024-10-10 23:18:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22752 states, 22751 states have (on average 1.1521251813107116) internal successors, (26212), 22751 states have internal predecessors, (26212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22752 states to 22752 states and 26212 transitions. [2024-10-10 23:18:44,590 INFO L78 Accepts]: Start accepts. Automaton has 22752 states and 26212 transitions. Word has length 359 [2024-10-10 23:18:44,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:44,591 INFO L471 AbstractCegarLoop]: Abstraction has 22752 states and 26212 transitions. [2024-10-10 23:18:44,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:44,591 INFO L276 IsEmpty]: Start isEmpty. Operand 22752 states and 26212 transitions. [2024-10-10 23:18:44,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2024-10-10 23:18:44,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:44,609 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:44,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-10 23:18:44,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:18:44,810 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:44,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:44,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1855965577, now seen corresponding path program 1 times [2024-10-10 23:18:44,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:44,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465506722] [2024-10-10 23:18:44,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:44,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-10 23:18:45,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:45,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465506722] [2024-10-10 23:18:45,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465506722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:45,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:45,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:45,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039644984] [2024-10-10 23:18:45,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:45,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:45,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:45,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:45,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:45,382 INFO L87 Difference]: Start difference. First operand 22752 states and 26212 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:46,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:46,134 INFO L93 Difference]: Finished difference Result 44957 states and 51821 transitions. [2024-10-10 23:18:46,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:46,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 429 [2024-10-10 23:18:46,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:46,158 INFO L225 Difference]: With dead ends: 44957 [2024-10-10 23:18:46,159 INFO L226 Difference]: Without dead ends: 24232 [2024-10-10 23:18:46,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:46,176 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 140 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:46,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 142 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:18:46,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24232 states. [2024-10-10 23:18:46,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24232 to 22754. [2024-10-10 23:18:46,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22754 states, 22753 states have (on average 1.15184810794181) internal successors, (26208), 22753 states have internal predecessors, (26208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:46,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22754 states to 22754 states and 26208 transitions. [2024-10-10 23:18:46,502 INFO L78 Accepts]: Start accepts. Automaton has 22754 states and 26208 transitions. Word has length 429 [2024-10-10 23:18:46,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:46,503 INFO L471 AbstractCegarLoop]: Abstraction has 22754 states and 26208 transitions. [2024-10-10 23:18:46,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:46,503 INFO L276 IsEmpty]: Start isEmpty. Operand 22754 states and 26208 transitions. [2024-10-10 23:18:46,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2024-10-10 23:18:46,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:46,526 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:46,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:18:46,526 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:46,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:46,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1515415118, now seen corresponding path program 1 times [2024-10-10 23:18:46,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:46,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171156350] [2024-10-10 23:18:46,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:46,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:46,807 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 487 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-10 23:18:46,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:46,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171156350] [2024-10-10 23:18:46,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171156350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:46,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:46,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:46,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379034854] [2024-10-10 23:18:46,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:46,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:46,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:46,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:46,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:46,811 INFO L87 Difference]: Start difference. First operand 22754 states and 26208 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:47,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:47,449 INFO L93 Difference]: Finished difference Result 42205 states and 48740 transitions. [2024-10-10 23:18:47,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:47,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 432 [2024-10-10 23:18:47,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:47,470 INFO L225 Difference]: With dead ends: 42205 [2024-10-10 23:18:47,471 INFO L226 Difference]: Without dead ends: 21478 [2024-10-10 23:18:47,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:47,488 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 137 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:47,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 331 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:18:47,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21478 states. [2024-10-10 23:18:47,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21478 to 21460. [2024-10-10 23:18:47,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21460 states, 21459 states have (on average 1.1256815322242415) internal successors, (24156), 21459 states have internal predecessors, (24156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:47,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21460 states to 21460 states and 24156 transitions. [2024-10-10 23:18:47,790 INFO L78 Accepts]: Start accepts. Automaton has 21460 states and 24156 transitions. Word has length 432 [2024-10-10 23:18:47,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:47,791 INFO L471 AbstractCegarLoop]: Abstraction has 21460 states and 24156 transitions. [2024-10-10 23:18:47,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:47,791 INFO L276 IsEmpty]: Start isEmpty. Operand 21460 states and 24156 transitions. [2024-10-10 23:18:47,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2024-10-10 23:18:47,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:47,802 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:47,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:18:47,803 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:47,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:47,803 INFO L85 PathProgramCache]: Analyzing trace with hash 236362662, now seen corresponding path program 1 times [2024-10-10 23:18:47,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:47,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117268555] [2024-10-10 23:18:47,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:47,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-10-10 23:18:48,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:48,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117268555] [2024-10-10 23:18:48,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117268555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:48,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:48,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:18:48,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412506507] [2024-10-10 23:18:48,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:48,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:48,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:48,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:48,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:48,038 INFO L87 Difference]: Start difference. First operand 21460 states and 24156 transitions. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:48,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:48,387 INFO L93 Difference]: Finished difference Result 40142 states and 45234 transitions. [2024-10-10 23:18:48,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:48,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 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 436 [2024-10-10 23:18:48,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:48,407 INFO L225 Difference]: With dead ends: 40142 [2024-10-10 23:18:48,407 INFO L226 Difference]: Without dead ends: 20709 [2024-10-10 23:18:48,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:48,419 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 189 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:48,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 38 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:18:48,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20709 states. [2024-10-10 23:18:48,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20709 to 20700. [2024-10-10 23:18:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20700 states, 20699 states have (on average 1.1238707183921928) internal successors, (23263), 20699 states have internal predecessors, (23263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:48,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20700 states to 20700 states and 23263 transitions. [2024-10-10 23:18:48,597 INFO L78 Accepts]: Start accepts. Automaton has 20700 states and 23263 transitions. Word has length 436 [2024-10-10 23:18:48,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:48,597 INFO L471 AbstractCegarLoop]: Abstraction has 20700 states and 23263 transitions. [2024-10-10 23:18:48,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:48,597 INFO L276 IsEmpty]: Start isEmpty. Operand 20700 states and 23263 transitions. [2024-10-10 23:18:48,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2024-10-10 23:18:48,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:48,607 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:48,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:18:48,607 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:48,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:48,607 INFO L85 PathProgramCache]: Analyzing trace with hash -10063876, now seen corresponding path program 1 times [2024-10-10 23:18:48,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:48,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568876515] [2024-10-10 23:18:48,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:48,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:48,825 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 357 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-10 23:18:48,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:48,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568876515] [2024-10-10 23:18:48,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568876515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:48,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:48,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:48,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894869176] [2024-10-10 23:18:48,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:48,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:48,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:48,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:48,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:48,828 INFO L87 Difference]: Start difference. First operand 20700 states and 23263 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:49,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:49,413 INFO L93 Difference]: Finished difference Result 36033 states and 40328 transitions. [2024-10-10 23:18:49,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:49,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 452 [2024-10-10 23:18:49,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:49,431 INFO L225 Difference]: With dead ends: 36033 [2024-10-10 23:18:49,431 INFO L226 Difference]: Without dead ends: 17174 [2024-10-10 23:18:49,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:49,442 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 134 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:49,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 133 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:18:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17174 states. [2024-10-10 23:18:49,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17174 to 16990. [2024-10-10 23:18:49,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16990 states, 16989 states have (on average 1.1065983871917122) internal successors, (18800), 16989 states have internal predecessors, (18800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:49,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16990 states to 16990 states and 18800 transitions. [2024-10-10 23:18:49,591 INFO L78 Accepts]: Start accepts. Automaton has 16990 states and 18800 transitions. Word has length 452 [2024-10-10 23:18:49,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:49,592 INFO L471 AbstractCegarLoop]: Abstraction has 16990 states and 18800 transitions. [2024-10-10 23:18:49,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:49,592 INFO L276 IsEmpty]: Start isEmpty. Operand 16990 states and 18800 transitions. [2024-10-10 23:18:49,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-10-10 23:18:49,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:49,602 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:49,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:18:49,602 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:49,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:49,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1680575125, now seen corresponding path program 1 times [2024-10-10 23:18:49,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:49,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660195304] [2024-10-10 23:18:49,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:49,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:50,276 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-10 23:18:50,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:50,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660195304] [2024-10-10 23:18:50,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660195304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:50,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:50,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:18:50,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944627628] [2024-10-10 23:18:50,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:50,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 23:18:50,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:50,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 23:18:50,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:18:50,279 INFO L87 Difference]: Start difference. First operand 16990 states and 18800 transitions. Second operand has 5 states, 5 states have (on average 73.4) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:51,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:51,177 INFO L93 Difference]: Finished difference Result 32216 states and 35693 transitions. [2024-10-10 23:18:51,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 23:18:51,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 73.4) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 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 490 [2024-10-10 23:18:51,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:51,198 INFO L225 Difference]: With dead ends: 32216 [2024-10-10 23:18:51,198 INFO L226 Difference]: Without dead ends: 17253 [2024-10-10 23:18:51,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:18:51,210 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 267 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:51,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 52 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:18:51,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17253 states. [2024-10-10 23:18:51,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17253 to 17175. [2024-10-10 23:18:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17175 states, 17174 states have (on average 1.1051007336671712) internal successors, (18979), 17174 states have internal predecessors, (18979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17175 states to 17175 states and 18979 transitions. [2024-10-10 23:18:51,349 INFO L78 Accepts]: Start accepts. Automaton has 17175 states and 18979 transitions. Word has length 490 [2024-10-10 23:18:51,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:51,350 INFO L471 AbstractCegarLoop]: Abstraction has 17175 states and 18979 transitions. [2024-10-10 23:18:51,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.4) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:51,350 INFO L276 IsEmpty]: Start isEmpty. Operand 17175 states and 18979 transitions. [2024-10-10 23:18:51,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2024-10-10 23:18:51,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:51,362 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, 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, 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-10 23:18:51,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:18:51,362 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:51,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:51,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1024549485, now seen corresponding path program 1 times [2024-10-10 23:18:51,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:51,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156418699] [2024-10-10 23:18:51,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:51,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:51,671 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 685 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-10-10 23:18:51,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:51,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156418699] [2024-10-10 23:18:51,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156418699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:51,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:51,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:51,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632428252] [2024-10-10 23:18:51,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:51,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:51,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:51,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:51,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:51,676 INFO L87 Difference]: Start difference. First operand 17175 states and 18979 transitions. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:52,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:52,225 INFO L93 Difference]: Finished difference Result 34901 states and 38587 transitions. [2024-10-10 23:18:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:52,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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 512 [2024-10-10 23:18:52,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:52,244 INFO L225 Difference]: With dead ends: 34901 [2024-10-10 23:18:52,244 INFO L226 Difference]: Without dead ends: 18831 [2024-10-10 23:18:52,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:52,256 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 63 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:52,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 365 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:18:52,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18831 states. [2024-10-10 23:18:52,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18831 to 17911. [2024-10-10 23:18:52,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17911 states, 17910 states have (on average 1.102791736460078) internal successors, (19751), 17910 states have internal predecessors, (19751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:52,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17911 states to 17911 states and 19751 transitions. [2024-10-10 23:18:52,421 INFO L78 Accepts]: Start accepts. Automaton has 17911 states and 19751 transitions. Word has length 512 [2024-10-10 23:18:52,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:52,422 INFO L471 AbstractCegarLoop]: Abstraction has 17911 states and 19751 transitions. [2024-10-10 23:18:52,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:52,422 INFO L276 IsEmpty]: Start isEmpty. Operand 17911 states and 19751 transitions. [2024-10-10 23:18:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2024-10-10 23:18:52,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:52,439 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:52,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:18:52,440 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:52,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:52,440 INFO L85 PathProgramCache]: Analyzing trace with hash 26251403, now seen corresponding path program 1 times [2024-10-10 23:18:52,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:52,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934870371] [2024-10-10 23:18:52,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:52,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:53,086 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 470 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-10-10 23:18:53,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:53,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934870371] [2024-10-10 23:18:53,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934870371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:53,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:53,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:53,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832599937] [2024-10-10 23:18:53,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:53,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:53,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:53,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:53,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:53,090 INFO L87 Difference]: Start difference. First operand 17911 states and 19751 transitions. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:53,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:53,835 INFO L93 Difference]: Finished difference Result 37481 states and 41347 transitions. [2024-10-10 23:18:53,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:53,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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 544 [2024-10-10 23:18:53,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:53,857 INFO L225 Difference]: With dead ends: 37481 [2024-10-10 23:18:53,857 INFO L226 Difference]: Without dead ends: 20675 [2024-10-10 23:18:53,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:53,871 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 54 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:53,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 62 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:18:53,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20675 states. [2024-10-10 23:18:54,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20675 to 18095. [2024-10-10 23:18:54,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18095 states, 18094 states have (on average 1.1020780369183154) internal successors, (19941), 18094 states have internal predecessors, (19941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:54,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18095 states to 18095 states and 19941 transitions. [2024-10-10 23:18:54,050 INFO L78 Accepts]: Start accepts. Automaton has 18095 states and 19941 transitions. Word has length 544 [2024-10-10 23:18:54,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:54,051 INFO L471 AbstractCegarLoop]: Abstraction has 18095 states and 19941 transitions. [2024-10-10 23:18:54,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:54,051 INFO L276 IsEmpty]: Start isEmpty. Operand 18095 states and 19941 transitions. [2024-10-10 23:18:54,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2024-10-10 23:18:54,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:54,065 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, 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:54,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 23:18:54,065 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:54,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:54,065 INFO L85 PathProgramCache]: Analyzing trace with hash 773284934, now seen corresponding path program 1 times [2024-10-10 23:18:54,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:54,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005154751] [2024-10-10 23:18:54,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:54,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:55,114 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 653 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-10-10 23:18:55,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:55,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005154751] [2024-10-10 23:18:55,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005154751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:55,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:55,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:18:55,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073824216] [2024-10-10 23:18:55,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:55,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 23:18:55,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:55,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 23:18:55,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:18:55,117 INFO L87 Difference]: Start difference. First operand 18095 states and 19941 transitions. Second operand has 7 states, 7 states have (on average 57.57142857142857) internal successors, (403), 6 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:56,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:56,435 INFO L93 Difference]: Finished difference Result 36746 states and 40474 transitions. [2024-10-10 23:18:56,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 23:18:56,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 57.57142857142857) internal successors, (403), 6 states have internal predecessors, (403), 0 states have call successors, (0), 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 554 [2024-10-10 23:18:56,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:56,457 INFO L225 Difference]: With dead ends: 36746 [2024-10-10 23:18:56,457 INFO L226 Difference]: Without dead ends: 21046 [2024-10-10 23:18:56,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:18:56,468 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 214 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 2416 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 2445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:56,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 219 Invalid, 2445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:18:56,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21046 states. [2024-10-10 23:18:56,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21046 to 18647. [2024-10-10 23:18:56,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18647 states, 18646 states have (on average 1.1025957309878793) internal successors, (20559), 18646 states have internal predecessors, (20559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:56,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18647 states to 18647 states and 20559 transitions. [2024-10-10 23:18:56,637 INFO L78 Accepts]: Start accepts. Automaton has 18647 states and 20559 transitions. Word has length 554 [2024-10-10 23:18:56,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:56,637 INFO L471 AbstractCegarLoop]: Abstraction has 18647 states and 20559 transitions. [2024-10-10 23:18:56,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 57.57142857142857) internal successors, (403), 6 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:56,637 INFO L276 IsEmpty]: Start isEmpty. Operand 18647 states and 20559 transitions. [2024-10-10 23:18:56,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2024-10-10 23:18:56,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:56,649 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:56,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-10 23:18:56,649 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:56,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:56,650 INFO L85 PathProgramCache]: Analyzing trace with hash 896459167, now seen corresponding path program 1 times [2024-10-10 23:18:56,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:56,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553195383] [2024-10-10 23:18:56,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:56,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:57,887 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 665 proven. 8 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-10-10 23:18:57,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:57,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553195383] [2024-10-10 23:18:57,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553195383] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:18:57,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480519378] [2024-10-10 23:18:57,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:57,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:18:57,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:18:57,890 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:18:57,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 23:18:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:58,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 23:18:58,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:18:58,882 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 552 proven. 121 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-10-10 23:18:58,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:19:01,423 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 552 proven. 121 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-10-10 23:19:01,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480519378] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:19:01,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:19:01,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2024-10-10 23:19:01,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145918910] [2024-10-10 23:19:01,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:19:01,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-10 23:19:01,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:01,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-10 23:19:01,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-10 23:19:01,427 INFO L87 Difference]: Start difference. First operand 18647 states and 20559 transitions. Second operand has 11 states, 11 states have (on average 89.0) internal successors, (979), 10 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:05,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:05,446 INFO L93 Difference]: Finished difference Result 40614 states and 44663 transitions. [2024-10-10 23:19:05,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-10 23:19:05,447 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 89.0) internal successors, (979), 10 states have internal predecessors, (979), 0 states have call successors, (0), 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 564 [2024-10-10 23:19:05,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:05,481 INFO L225 Difference]: With dead ends: 40614 [2024-10-10 23:19:05,481 INFO L226 Difference]: Without dead ends: 23994 [2024-10-10 23:19:05,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1149 GetRequests, 1124 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2024-10-10 23:19:05,500 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 1391 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4438 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 4955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 4438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:05,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 165 Invalid, 4955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 4438 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-10 23:19:05,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23994 states. [2024-10-10 23:19:05,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23994 to 14779. [2024-10-10 23:19:05,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14779 states, 14778 states have (on average 1.0763296792529435) internal successors, (15906), 14778 states have internal predecessors, (15906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:05,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14779 states to 14779 states and 15906 transitions. [2024-10-10 23:19:05,717 INFO L78 Accepts]: Start accepts. Automaton has 14779 states and 15906 transitions. Word has length 564 [2024-10-10 23:19:05,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:05,717 INFO L471 AbstractCegarLoop]: Abstraction has 14779 states and 15906 transitions. [2024-10-10 23:19:05,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.0) internal successors, (979), 10 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:05,717 INFO L276 IsEmpty]: Start isEmpty. Operand 14779 states and 15906 transitions. [2024-10-10 23:19:05,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2024-10-10 23:19:05,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:05,729 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:05,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-10 23:19:05,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-10 23:19:05,930 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:05,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:05,930 INFO L85 PathProgramCache]: Analyzing trace with hash 542889811, now seen corresponding path program 1 times [2024-10-10 23:19:05,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:05,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897147334] [2024-10-10 23:19:05,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:05,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:06,463 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 679 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-10-10 23:19:06,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:06,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897147334] [2024-10-10 23:19:06,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897147334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:06,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:06,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:06,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333146769] [2024-10-10 23:19:06,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:06,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:19:06,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:06,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:19:06,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:19:06,466 INFO L87 Difference]: Start difference. First operand 14779 states and 15906 transitions. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:07,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:07,446 INFO L93 Difference]: Finished difference Result 32136 states and 34607 transitions. [2024-10-10 23:19:07,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:19:07,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 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 588 [2024-10-10 23:19:07,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:07,463 INFO L225 Difference]: With dead ends: 32136 [2024-10-10 23:19:07,463 INFO L226 Difference]: Without dead ends: 17726 [2024-10-10 23:19:07,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:19:07,474 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 102 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:07,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 115 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:19:07,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17726 states. [2024-10-10 23:19:07,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17726 to 17354. [2024-10-10 23:19:07,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17354 states, 17353 states have (on average 1.066904857949634) internal successors, (18514), 17353 states have internal predecessors, (18514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17354 states to 17354 states and 18514 transitions. [2024-10-10 23:19:07,731 INFO L78 Accepts]: Start accepts. Automaton has 17354 states and 18514 transitions. Word has length 588 [2024-10-10 23:19:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:07,731 INFO L471 AbstractCegarLoop]: Abstraction has 17354 states and 18514 transitions. [2024-10-10 23:19:07,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 17354 states and 18514 transitions. [2024-10-10 23:19:07,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2024-10-10 23:19:07,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:07,742 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:07,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-10 23:19:07,743 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:07,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:07,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1171081188, now seen corresponding path program 1 times [2024-10-10 23:19:07,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:07,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494078670] [2024-10-10 23:19:07,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:07,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:08,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 1049 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-10-10 23:19:08,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:08,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494078670] [2024-10-10 23:19:08,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494078670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:08,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:08,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:19:08,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623918873] [2024-10-10 23:19:08,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:08,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:19:08,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:08,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:19:08,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:19:08,375 INFO L87 Difference]: Start difference. First operand 17354 states and 18514 transitions. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:09,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:09,330 INFO L93 Difference]: Finished difference Result 34899 states and 37306 transitions. [2024-10-10 23:19:09,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:19:09,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 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 606 [2024-10-10 23:19:09,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:09,349 INFO L225 Difference]: With dead ends: 34899 [2024-10-10 23:19:09,349 INFO L226 Difference]: Without dead ends: 19942 [2024-10-10 23:19:09,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:19:09,360 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 208 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:09,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 133 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:19:09,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19942 states. [2024-10-10 23:19:09,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19942 to 18459. [2024-10-10 23:19:09,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18459 states, 18458 states have (on average 1.0635496803554014) internal successors, (19631), 18458 states have internal predecessors, (19631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:09,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18459 states to 18459 states and 19631 transitions. [2024-10-10 23:19:09,538 INFO L78 Accepts]: Start accepts. Automaton has 18459 states and 19631 transitions. Word has length 606 [2024-10-10 23:19:09,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:09,538 INFO L471 AbstractCegarLoop]: Abstraction has 18459 states and 19631 transitions. [2024-10-10 23:19:09,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:09,538 INFO L276 IsEmpty]: Start isEmpty. Operand 18459 states and 19631 transitions. [2024-10-10 23:19:09,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2024-10-10 23:19:09,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:09,552 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-10 23:19:09,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-10 23:19:09,553 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:09,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:09,553 INFO L85 PathProgramCache]: Analyzing trace with hash -594000565, now seen corresponding path program 1 times [2024-10-10 23:19:09,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:09,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149601572] [2024-10-10 23:19:09,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:09,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:11,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 834 proven. 931 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-10-10 23:19:11,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:11,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149601572] [2024-10-10 23:19:11,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149601572] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:19:11,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564185667] [2024-10-10 23:19:11,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:11,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:19:11,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:19:11,450 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:19:11,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 23:19:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:11,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 23:19:11,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:19:11,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 816 proven. 0 refuted. 0 times theorem prover too weak. 1137 trivial. 0 not checked. [2024-10-10 23:19:11,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:19:11,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564185667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:11,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:19:11,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-10-10 23:19:11,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521935016] [2024-10-10 23:19:11,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:11,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:11,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:11,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:11,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:19:11,938 INFO L87 Difference]: Start difference. First operand 18459 states and 19631 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:12,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:12,537 INFO L93 Difference]: Finished difference Result 35446 states and 37751 transitions. [2024-10-10 23:19:12,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:12,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 747 [2024-10-10 23:19:12,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:12,555 INFO L225 Difference]: With dead ends: 35446 [2024-10-10 23:19:12,555 INFO L226 Difference]: Without dead ends: 19384 [2024-10-10 23:19:12,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:19:12,565 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 88 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:12,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 345 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:19:12,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19384 states. [2024-10-10 23:19:12,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19384 to 19011. [2024-10-10 23:19:12,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19011 states, 19010 states have (on average 1.0602314571278275) internal successors, (20155), 19010 states have internal predecessors, (20155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:12,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19011 states to 19011 states and 20155 transitions. [2024-10-10 23:19:12,732 INFO L78 Accepts]: Start accepts. Automaton has 19011 states and 20155 transitions. Word has length 747 [2024-10-10 23:19:12,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:12,732 INFO L471 AbstractCegarLoop]: Abstraction has 19011 states and 20155 transitions. [2024-10-10 23:19:12,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:12,733 INFO L276 IsEmpty]: Start isEmpty. Operand 19011 states and 20155 transitions. [2024-10-10 23:19:12,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2024-10-10 23:19:12,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:12,746 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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] [2024-10-10 23:19:12,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-10 23:19:12,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-10 23:19:12,947 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:12,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:12,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1481400515, now seen corresponding path program 1 times [2024-10-10 23:19:12,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:12,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009956095] [2024-10-10 23:19:12,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:12,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:13,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1825 backedges. 798 proven. 0 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-10-10 23:19:13,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:13,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009956095] [2024-10-10 23:19:13,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009956095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:13,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:13,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:13,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923491046] [2024-10-10 23:19:13,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:13,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:13,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:13,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:13,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:13,692 INFO L87 Difference]: Start difference. First operand 19011 states and 20155 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:14,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:14,376 INFO L93 Difference]: Finished difference Result 36550 states and 38799 transitions. [2024-10-10 23:19:14,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:14,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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 759 [2024-10-10 23:19:14,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:14,399 INFO L225 Difference]: With dead ends: 36550 [2024-10-10 23:19:14,399 INFO L226 Difference]: Without dead ends: 19936 [2024-10-10 23:19:14,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:14,409 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 88 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:14,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 155 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:19:14,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19936 states. [2024-10-10 23:19:14,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19936 to 18643. [2024-10-10 23:19:14,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18643 states, 18642 states have (on average 1.0604548868147194) internal successors, (19769), 18642 states have internal predecessors, (19769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18643 states to 18643 states and 19769 transitions. [2024-10-10 23:19:14,563 INFO L78 Accepts]: Start accepts. Automaton has 18643 states and 19769 transitions. Word has length 759 [2024-10-10 23:19:14,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:14,563 INFO L471 AbstractCegarLoop]: Abstraction has 18643 states and 19769 transitions. [2024-10-10 23:19:14,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:14,563 INFO L276 IsEmpty]: Start isEmpty. Operand 18643 states and 19769 transitions. [2024-10-10 23:19:14,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2024-10-10 23:19:14,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:14,576 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:19:14,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-10 23:19:14,577 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:14,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:14,577 INFO L85 PathProgramCache]: Analyzing trace with hash -856790792, now seen corresponding path program 1 times [2024-10-10 23:19:14,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:14,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987178619] [2024-10-10 23:19:14,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:14,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:15,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 798 proven. 0 refuted. 0 times theorem prover too weak. 1026 trivial. 0 not checked. [2024-10-10 23:19:15,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:15,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987178619] [2024-10-10 23:19:15,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987178619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:15,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:15,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:19:15,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112851894] [2024-10-10 23:19:15,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:15,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:19:15,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:15,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:19:15,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:19:15,140 INFO L87 Difference]: Start difference. First operand 18643 states and 19769 transitions. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:15,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:15,946 INFO L93 Difference]: Finished difference Result 35253 states and 37411 transitions. [2024-10-10 23:19:15,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:19:15,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 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 760 [2024-10-10 23:19:15,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:15,963 INFO L225 Difference]: With dead ends: 35253 [2024-10-10 23:19:15,963 INFO L226 Difference]: Without dead ends: 18639 [2024-10-10 23:19:15,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:19:15,974 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 286 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:15,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 133 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:19:15,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18639 states. [2024-10-10 23:19:16,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18639 to 16980. [2024-10-10 23:19:16,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16980 states, 16979 states have (on average 1.0581306319571235) internal successors, (17966), 16979 states have internal predecessors, (17966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:16,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16980 states to 16980 states and 17966 transitions. [2024-10-10 23:19:16,125 INFO L78 Accepts]: Start accepts. Automaton has 16980 states and 17966 transitions. Word has length 760 [2024-10-10 23:19:16,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:16,126 INFO L471 AbstractCegarLoop]: Abstraction has 16980 states and 17966 transitions. [2024-10-10 23:19:16,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:16,126 INFO L276 IsEmpty]: Start isEmpty. Operand 16980 states and 17966 transitions. [2024-10-10 23:19:16,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 934 [2024-10-10 23:19:16,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:16,141 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:16,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-10 23:19:16,141 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:16,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:16,142 INFO L85 PathProgramCache]: Analyzing trace with hash 164669317, now seen corresponding path program 1 times [2024-10-10 23:19:16,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:16,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451135045] [2024-10-10 23:19:16,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:16,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:17,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2554 backedges. 2015 proven. 0 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2024-10-10 23:19:17,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:17,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451135045] [2024-10-10 23:19:17,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451135045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:17,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:17,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:19:17,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778805109] [2024-10-10 23:19:17,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:17,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:19:17,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:17,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:19:17,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:19:17,063 INFO L87 Difference]: Start difference. First operand 16980 states and 17966 transitions. Second operand has 4 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:18,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:18,148 INFO L93 Difference]: Finished difference Result 38018 states and 40219 transitions. [2024-10-10 23:19:18,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:19:18,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 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 933 [2024-10-10 23:19:18,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:18,166 INFO L225 Difference]: With dead ends: 38018 [2024-10-10 23:19:18,166 INFO L226 Difference]: Without dead ends: 21411 [2024-10-10 23:19:18,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:19:18,176 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 219 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:18,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 59 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:19:18,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21411 states. [2024-10-10 23:19:18,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21411 to 14768. [2024-10-10 23:19:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14768 states, 14767 states have (on average 1.0547843163811201) internal successors, (15576), 14767 states have internal predecessors, (15576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:18,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14768 states to 14768 states and 15576 transitions. [2024-10-10 23:19:18,332 INFO L78 Accepts]: Start accepts. Automaton has 14768 states and 15576 transitions. Word has length 933 [2024-10-10 23:19:18,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:18,332 INFO L471 AbstractCegarLoop]: Abstraction has 14768 states and 15576 transitions. [2024-10-10 23:19:18,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:18,332 INFO L276 IsEmpty]: Start isEmpty. Operand 14768 states and 15576 transitions. [2024-10-10 23:19:18,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1026 [2024-10-10 23:19:18,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:18,347 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:18,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-10 23:19:18,347 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:18,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:18,347 INFO L85 PathProgramCache]: Analyzing trace with hash -418780773, now seen corresponding path program 1 times [2024-10-10 23:19:18,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:18,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087832069] [2024-10-10 23:19:18,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:18,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2814 backedges. 2143 proven. 0 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2024-10-10 23:19:19,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:19,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087832069] [2024-10-10 23:19:19,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087832069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:19,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:19,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:19:19,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158810160] [2024-10-10 23:19:19,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:19,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:19:19,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:19,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:19:19,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:19:19,208 INFO L87 Difference]: Start difference. First operand 14768 states and 15576 transitions. Second operand has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:20,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:20,043 INFO L93 Difference]: Finished difference Result 27866 states and 29391 transitions. [2024-10-10 23:19:20,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:19:20,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 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 1025 [2024-10-10 23:19:20,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:20,046 INFO L225 Difference]: With dead ends: 27866 [2024-10-10 23:19:20,046 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:19:20,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:19:20,056 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 216 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:20,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 32 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:19:20,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:19:20,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:19:20,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:19:20,058 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1025 [2024-10-10 23:19:20,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:20,058 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:19:20,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:20,059 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:19:20,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:19:20,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:19:20,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-10 23:19:20,064 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:20,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.