./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label34.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/Problem13_label34.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 c727ce378f9c6151587faf5638863d5f3634ffe42c74bcfcd0e6318a1faa4f2e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:29:15,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:29:15,631 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:29:15,635 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:29:15,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:29:15,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:29:15,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:29:15,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:29:15,659 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:29:15,660 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:29:15,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:29:15,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:29:15,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:29:15,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:29:15,663 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:29:15,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:29:15,664 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:29:15,664 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:29:15,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:29:15,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:29:15,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:29:15,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:29:15,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:29:15,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:29:15,669 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:29:15,669 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:29:15,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:29:15,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:29:15,670 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:29:15,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:29:15,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:29:15,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:29:15,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:29:15,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:29:15,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:29:15,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:29:15,672 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:29:15,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:29:15,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:29:15,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:29:15,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:29:15,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:29:15,674 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 -> c727ce378f9c6151587faf5638863d5f3634ffe42c74bcfcd0e6318a1faa4f2e [2024-10-10 23:29:15,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:29:15,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:29:15,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:29:15,957 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:29:15,957 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:29:15,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label34.c [2024-10-10 23:29:17,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:29:17,851 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:29:17,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label34.c [2024-10-10 23:29:17,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/01ae6c79c/343f1faa2b1e42fcbf22ff684032ee81/FLAG905822de2 [2024-10-10 23:29:17,911 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/01ae6c79c/343f1faa2b1e42fcbf22ff684032ee81 [2024-10-10 23:29:17,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:29:17,916 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:29:17,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:29:17,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:29:17,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:29:17,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:29:17" (1/1) ... [2024-10-10 23:29:17,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43270e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:17, skipping insertion in model container [2024-10-10 23:29:17,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:29:17" (1/1) ... [2024-10-10 23:29:18,056 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:29:18,360 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label34.c[7959,7972] [2024-10-10 23:29:19,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:29:19,205 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:29:19,235 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label34.c[7959,7972] [2024-10-10 23:29:19,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:29:19,711 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:29:19,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:19 WrapperNode [2024-10-10 23:29:19,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:29:19,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:29:19,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:29:19,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:29:19,721 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:29:19" (1/1) ... [2024-10-10 23:29:19,798 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:29:19" (1/1) ... [2024-10-10 23:29:20,367 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-10 23:29:20,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:29:20,370 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:29:20,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:29:20,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:29:20,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:19" (1/1) ... [2024-10-10 23:29:20,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:19" (1/1) ... [2024-10-10 23:29:20,468 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:19" (1/1) ... [2024-10-10 23:29:20,784 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:29:20,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:19" (1/1) ... [2024-10-10 23:29:20,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:19" (1/1) ... [2024-10-10 23:29:21,147 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:19" (1/1) ... [2024-10-10 23:29:21,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:19" (1/1) ... [2024-10-10 23:29:21,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:19" (1/1) ... [2024-10-10 23:29:21,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:19" (1/1) ... [2024-10-10 23:29:21,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:29:21,347 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:29:21,347 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:29:21,348 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:29:21,348 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:19" (1/1) ... [2024-10-10 23:29:21,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:29:21,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:29:21,380 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:29:21,385 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:29:21,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:29:21,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:29:21,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:29:21,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:29:21,504 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:29:21,506 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:29:27,785 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-10 23:29:27,785 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:29:27,866 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:29:27,866 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:29:27,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:29:27 BoogieIcfgContainer [2024-10-10 23:29:27,867 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:29:27,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:29:27,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:29:27,874 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:29:27,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:29:17" (1/3) ... [2024-10-10 23:29:27,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2711dce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:29:27, skipping insertion in model container [2024-10-10 23:29:27,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:19" (2/3) ... [2024-10-10 23:29:27,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2711dce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:29:27, skipping insertion in model container [2024-10-10 23:29:27,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:29:27" (3/3) ... [2024-10-10 23:29:27,877 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label34.c [2024-10-10 23:29:27,894 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:29:27,894 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:29:28,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:29:28,035 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;@c27e75a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:29:28,035 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:29:28,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:28,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-10 23:29:28,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:28,052 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, 1] [2024-10-10 23:29:28,052 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:28,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:28,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1896251352, now seen corresponding path program 1 times [2024-10-10 23:29:28,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:28,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630735675] [2024-10-10 23:29:28,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:28,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:28,250 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:29:28,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:28,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630735675] [2024-10-10 23:29:28,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630735675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:28,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:28,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:29:28,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180636219] [2024-10-10 23:29:28,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:28,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:29:28,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:28,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:29:28,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:29:28,290 INFO L87 Difference]: Start difference. First operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:29:28,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:28,395 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-10 23:29:28,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:29:28,398 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-10 23:29:28,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:28,419 INFO L225 Difference]: With dead ends: 2071 [2024-10-10 23:29:28,420 INFO L226 Difference]: Without dead ends: 1034 [2024-10-10 23:29:28,428 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:29:28,435 INFO L432 NwaCegarLoop]: 1876 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:28,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1876 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:29:28,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-10 23:29:28,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-10 23:29:28,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-10 23:29:28,542 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 55 [2024-10-10 23:29:28,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:28,543 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-10 23:29:28,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:29:28,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-10 23:29:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-10 23:29:28,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:28,545 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, 1] [2024-10-10 23:29:28,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:29:28,546 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:28,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:28,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1679085179, now seen corresponding path program 1 times [2024-10-10 23:29:28,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:28,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986790200] [2024-10-10 23:29:28,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:28,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:28,774 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:29:28,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:28,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986790200] [2024-10-10 23:29:28,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986790200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:28,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:28,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:29:28,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752729374] [2024-10-10 23:29:28,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:28,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:28,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:28,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:28,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:28,781 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:29:32,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:32,417 INFO L93 Difference]: Finished difference Result 2931 states and 5350 transitions. [2024-10-10 23:29:32,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:32,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-10 23:29:32,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:32,425 INFO L225 Difference]: With dead ends: 2931 [2024-10-10 23:29:32,425 INFO L226 Difference]: Without dead ends: 1898 [2024-10-10 23:29:32,427 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:29:32,428 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 959 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 2875 mSolverCounterSat, 560 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 3435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 560 IncrementalHoareTripleChecker+Valid, 2875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:32,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 594 Invalid, 3435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [560 Valid, 2875 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-10 23:29:32,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2024-10-10 23:29:32,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1893. [2024-10-10 23:29:32,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1892 states have (on average 1.73784355179704) internal successors, (3288), 1892 states have internal predecessors, (3288), 0 states have call successors, (0), 0 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:29:32,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 3288 transitions. [2024-10-10 23:29:32,480 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 3288 transitions. Word has length 55 [2024-10-10 23:29:32,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:32,481 INFO L471 AbstractCegarLoop]: Abstraction has 1893 states and 3288 transitions. [2024-10-10 23:29:32,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:29:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 3288 transitions. [2024-10-10 23:29:32,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-10 23:29:32,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:32,487 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:29:32,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:29:32,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:32,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:32,491 INFO L85 PathProgramCache]: Analyzing trace with hash -179073679, now seen corresponding path program 1 times [2024-10-10 23:29:32,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:32,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14349402] [2024-10-10 23:29:32,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:32,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:32,732 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:29:32,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:32,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14349402] [2024-10-10 23:29:32,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14349402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:32,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:32,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:29:32,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733466959] [2024-10-10 23:29:32,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:32,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:32,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:32,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:32,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:32,738 INFO L87 Difference]: Start difference. First operand 1893 states and 3288 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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:29:36,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:36,302 INFO L93 Difference]: Finished difference Result 5383 states and 9440 transitions. [2024-10-10 23:29:36,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:36,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2024-10-10 23:29:36,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:36,316 INFO L225 Difference]: With dead ends: 5383 [2024-10-10 23:29:36,317 INFO L226 Difference]: Without dead ends: 3491 [2024-10-10 23:29:36,320 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:29:36,321 INFO L432 NwaCegarLoop]: 858 mSDtfsCounter, 922 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2311 mSolverCounterSat, 879 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 3190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 879 IncrementalHoareTripleChecker+Valid, 2311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:36,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 1011 Invalid, 3190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [879 Valid, 2311 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-10 23:29:36,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3491 states. [2024-10-10 23:29:36,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3491 to 3490. [2024-10-10 23:29:36,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3490 states, 3489 states have (on average 1.5385497277156779) internal successors, (5368), 3489 states have internal predecessors, (5368), 0 states have call successors, (0), 0 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:29:36,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 5368 transitions. [2024-10-10 23:29:36,403 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 5368 transitions. Word has length 120 [2024-10-10 23:29:36,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:36,405 INFO L471 AbstractCegarLoop]: Abstraction has 3490 states and 5368 transitions. [2024-10-10 23:29:36,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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:29:36,405 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 5368 transitions. [2024-10-10 23:29:36,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-10 23:29:36,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:36,407 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:29:36,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:29:36,408 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:36,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:36,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1013488940, now seen corresponding path program 1 times [2024-10-10 23:29:36,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:36,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941534922] [2024-10-10 23:29:36,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:36,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:36,634 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:29:36,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:36,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941534922] [2024-10-10 23:29:36,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941534922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:36,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:36,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:29:36,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033554290] [2024-10-10 23:29:36,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:36,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:36,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:36,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:36,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:36,640 INFO L87 Difference]: Start difference. First operand 3490 states and 5368 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:29:39,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:39,832 INFO L93 Difference]: Finished difference Result 10168 states and 15699 transitions. [2024-10-10 23:29:39,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:39,833 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:29:39,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:39,852 INFO L225 Difference]: With dead ends: 10168 [2024-10-10 23:29:39,853 INFO L226 Difference]: Without dead ends: 6679 [2024-10-10 23:29:39,861 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:29:39,863 INFO L432 NwaCegarLoop]: 712 mSDtfsCounter, 977 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 3309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:39,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 845 Invalid, 3309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 2534 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:29:39,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6679 states. [2024-10-10 23:29:39,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6679 to 6668. [2024-10-10 23:29:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6668 states, 6667 states have (on average 1.3752812359382032) internal successors, (9169), 6667 states have internal predecessors, (9169), 0 states have call successors, (0), 0 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:29:39,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6668 states to 6668 states and 9169 transitions. [2024-10-10 23:29:39,977 INFO L78 Accepts]: Start accepts. Automaton has 6668 states and 9169 transitions. Word has length 122 [2024-10-10 23:29:39,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:39,979 INFO L471 AbstractCegarLoop]: Abstraction has 6668 states and 9169 transitions. [2024-10-10 23:29:39,979 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:29:39,979 INFO L276 IsEmpty]: Start isEmpty. Operand 6668 states and 9169 transitions. [2024-10-10 23:29:39,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-10 23:29:39,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:39,984 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, 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:29:39,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:29:39,984 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:39,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:39,985 INFO L85 PathProgramCache]: Analyzing trace with hash 215289182, now seen corresponding path program 1 times [2024-10-10 23:29:39,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:39,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603431752] [2024-10-10 23:29:39,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:39,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:29:40,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:40,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603431752] [2024-10-10 23:29:40,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603431752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:40,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:40,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:29:40,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722930628] [2024-10-10 23:29:40,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:40,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:40,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:40,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:40,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:40,422 INFO L87 Difference]: Start difference. First operand 6668 states and 9169 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 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:29:42,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:42,914 INFO L93 Difference]: Finished difference Result 14122 states and 19184 transitions. [2024-10-10 23:29:42,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:42,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2024-10-10 23:29:42,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:42,933 INFO L225 Difference]: With dead ends: 14122 [2024-10-10 23:29:42,934 INFO L226 Difference]: Without dead ends: 7455 [2024-10-10 23:29:42,942 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:29:42,942 INFO L432 NwaCegarLoop]: 1084 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2524 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:42,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1213 Invalid, 2578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2524 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:29:42,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7455 states. [2024-10-10 23:29:43,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7455 to 7455. [2024-10-10 23:29:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7455 states, 7454 states have (on average 1.3363294875234772) internal successors, (9961), 7454 states have internal predecessors, (9961), 0 states have call successors, (0), 0 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:29:43,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7455 states to 7455 states and 9961 transitions. [2024-10-10 23:29:43,058 INFO L78 Accepts]: Start accepts. Automaton has 7455 states and 9961 transitions. Word has length 166 [2024-10-10 23:29:43,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:43,058 INFO L471 AbstractCegarLoop]: Abstraction has 7455 states and 9961 transitions. [2024-10-10 23:29:43,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 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:29:43,059 INFO L276 IsEmpty]: Start isEmpty. Operand 7455 states and 9961 transitions. [2024-10-10 23:29:43,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-10 23:29:43,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:43,062 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, 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] [2024-10-10 23:29:43,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:29:43,062 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:43,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:43,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1902935284, now seen corresponding path program 1 times [2024-10-10 23:29:43,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:43,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721778224] [2024-10-10 23:29:43,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:43,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:29:43,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:43,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721778224] [2024-10-10 23:29:43,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721778224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:43,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:43,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:29:43,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470795388] [2024-10-10 23:29:43,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:43,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:29:43,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:43,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:29:43,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:29:43,308 INFO L87 Difference]: Start difference. First operand 7455 states and 9961 transitions. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 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:29:49,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:49,019 INFO L93 Difference]: Finished difference Result 26115 states and 35958 transitions. [2024-10-10 23:29:49,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:29:49,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 180 [2024-10-10 23:29:49,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:49,065 INFO L225 Difference]: With dead ends: 26115 [2024-10-10 23:29:49,066 INFO L226 Difference]: Without dead ends: 19448 [2024-10-10 23:29:49,074 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:29:49,077 INFO L432 NwaCegarLoop]: 897 mSDtfsCounter, 1633 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 6107 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1633 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 6757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 6107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:49,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1633 Valid, 1068 Invalid, 6757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 6107 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-10 23:29:49,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19448 states. [2024-10-10 23:29:49,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19448 to 19302. [2024-10-10 23:29:49,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19302 states, 19301 states have (on average 1.2778612507123983) internal successors, (24664), 19301 states have internal predecessors, (24664), 0 states have call successors, (0), 0 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:29:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19302 states to 19302 states and 24664 transitions. [2024-10-10 23:29:49,379 INFO L78 Accepts]: Start accepts. Automaton has 19302 states and 24664 transitions. Word has length 180 [2024-10-10 23:29:49,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:49,383 INFO L471 AbstractCegarLoop]: Abstraction has 19302 states and 24664 transitions. [2024-10-10 23:29:49,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 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:29:49,384 INFO L276 IsEmpty]: Start isEmpty. Operand 19302 states and 24664 transitions. [2024-10-10 23:29:49,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-10-10 23:29:49,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:49,389 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:29:49,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:29:49,389 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:49,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:49,390 INFO L85 PathProgramCache]: Analyzing trace with hash -861750944, now seen corresponding path program 1 times [2024-10-10 23:29:49,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:49,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728513506] [2024-10-10 23:29:49,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:49,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:49,804 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-10 23:29:49,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:49,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728513506] [2024-10-10 23:29:49,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728513506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:49,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:49,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:29:49,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928971078] [2024-10-10 23:29:49,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:49,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:49,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:49,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:49,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:49,808 INFO L87 Difference]: Start difference. First operand 19302 states and 24664 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 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:29:53,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:53,022 INFO L93 Difference]: Finished difference Result 33880 states and 44170 transitions. [2024-10-10 23:29:53,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:53,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 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 267 [2024-10-10 23:29:53,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:53,060 INFO L225 Difference]: With dead ends: 33880 [2024-10-10 23:29:53,060 INFO L226 Difference]: Without dead ends: 19311 [2024-10-10 23:29:53,079 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:29:53,080 INFO L432 NwaCegarLoop]: 1026 mSDtfsCounter, 728 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 2716 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 2720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:53,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1210 Invalid, 2720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2716 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:29:53,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19311 states. [2024-10-10 23:29:53,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19311 to 19302. [2024-10-10 23:29:53,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19302 states, 19301 states have (on average 1.276565981037252) internal successors, (24639), 19301 states have internal predecessors, (24639), 0 states have call successors, (0), 0 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:29:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19302 states to 19302 states and 24639 transitions. [2024-10-10 23:29:53,500 INFO L78 Accepts]: Start accepts. Automaton has 19302 states and 24639 transitions. Word has length 267 [2024-10-10 23:29:53,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:53,502 INFO L471 AbstractCegarLoop]: Abstraction has 19302 states and 24639 transitions. [2024-10-10 23:29:53,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 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:29:53,502 INFO L276 IsEmpty]: Start isEmpty. Operand 19302 states and 24639 transitions. [2024-10-10 23:29:53,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-10-10 23:29:53,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:53,507 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:53,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:29:53,508 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:53,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:53,509 INFO L85 PathProgramCache]: Analyzing trace with hash 753462364, now seen corresponding path program 1 times [2024-10-10 23:29:53,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:53,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976454353] [2024-10-10 23:29:53,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:53,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:53,726 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:29:53,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:53,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976454353] [2024-10-10 23:29:53,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976454353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:53,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:53,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:29:53,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667016919] [2024-10-10 23:29:53,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:53,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:53,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:53,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:53,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:53,731 INFO L87 Difference]: Start difference. First operand 19302 states and 24639 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 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:29:56,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:56,778 INFO L93 Difference]: Finished difference Result 51974 states and 67213 transitions. [2024-10-10 23:29:56,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:56,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 269 [2024-10-10 23:29:56,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:56,839 INFO L225 Difference]: With dead ends: 51974 [2024-10-10 23:29:56,840 INFO L226 Difference]: Without dead ends: 32673 [2024-10-10 23:29:56,868 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:29:56,869 INFO L432 NwaCegarLoop]: 1852 mSDtfsCounter, 842 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 2480 mSolverCounterSat, 807 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 1991 SdHoareTripleChecker+Invalid, 3287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 807 IncrementalHoareTripleChecker+Valid, 2480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:56,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 1991 Invalid, 3287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [807 Valid, 2480 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 23:29:56,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32673 states. [2024-10-10 23:29:57,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32673 to 31089. [2024-10-10 23:29:57,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31089 states, 31088 states have (on average 1.2295741121976325) internal successors, (38225), 31088 states have internal predecessors, (38225), 0 states have call successors, (0), 0 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:29:57,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31089 states to 31089 states and 38225 transitions. [2024-10-10 23:29:57,262 INFO L78 Accepts]: Start accepts. Automaton has 31089 states and 38225 transitions. Word has length 269 [2024-10-10 23:29:57,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:57,263 INFO L471 AbstractCegarLoop]: Abstraction has 31089 states and 38225 transitions. [2024-10-10 23:29:57,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 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:29:57,263 INFO L276 IsEmpty]: Start isEmpty. Operand 31089 states and 38225 transitions. [2024-10-10 23:29:57,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2024-10-10 23:29:57,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:57,268 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, 4, 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] [2024-10-10 23:29:57,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:29:57,269 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:57,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:57,269 INFO L85 PathProgramCache]: Analyzing trace with hash -317189685, now seen corresponding path program 1 times [2024-10-10 23:29:57,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:57,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558076197] [2024-10-10 23:29:57,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:57,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:57,472 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-10 23:29:57,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:57,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558076197] [2024-10-10 23:29:57,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558076197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:57,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:57,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:29:57,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933469682] [2024-10-10 23:29:57,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:57,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:57,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:57,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:57,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:57,476 INFO L87 Difference]: Start difference. First operand 31089 states and 38225 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 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:30:00,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:30:00,893 INFO L93 Difference]: Finished difference Result 85798 states and 106633 transitions. [2024-10-10 23:30:00,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:30:00,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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 291 [2024-10-10 23:30:00,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:30:00,986 INFO L225 Difference]: With dead ends: 85798 [2024-10-10 23:30:00,987 INFO L226 Difference]: Without dead ends: 55497 [2024-10-10 23:30:01,026 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:30:01,028 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 882 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 916 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 3296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 916 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:30:01,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 900 Invalid, 3296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [916 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-10 23:30:01,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55497 states. [2024-10-10 23:30:01,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55497 to 54700. [2024-10-10 23:30:01,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54700 states, 54699 states have (on average 1.186767582588347) internal successors, (64915), 54699 states have internal predecessors, (64915), 0 states have call successors, (0), 0 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:30:01,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54700 states to 54700 states and 64915 transitions. [2024-10-10 23:30:01,706 INFO L78 Accepts]: Start accepts. Automaton has 54700 states and 64915 transitions. Word has length 291 [2024-10-10 23:30:01,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:30:01,706 INFO L471 AbstractCegarLoop]: Abstraction has 54700 states and 64915 transitions. [2024-10-10 23:30:01,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 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:30:01,707 INFO L276 IsEmpty]: Start isEmpty. Operand 54700 states and 64915 transitions. [2024-10-10 23:30:01,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2024-10-10 23:30:01,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:01,715 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:01,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:30:01,715 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:01,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:01,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1373714603, now seen corresponding path program 1 times [2024-10-10 23:30:01,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:01,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238008393] [2024-10-10 23:30:01,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:01,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-10 23:30:01,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:01,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238008393] [2024-10-10 23:30:01,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238008393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:01,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:30:01,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:30:01,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587558652] [2024-10-10 23:30:01,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:01,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:30:01,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:01,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:30:01,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:30:01,971 INFO L87 Difference]: Start difference. First operand 54700 states and 64915 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 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:30:05,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:30:05,509 INFO L93 Difference]: Finished difference Result 129083 states and 155213 transitions. [2024-10-10 23:30:05,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:30:05,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 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 346 [2024-10-10 23:30:05,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:30:05,598 INFO L225 Difference]: With dead ends: 129083 [2024-10-10 23:30:05,598 INFO L226 Difference]: Without dead ends: 75171 [2024-10-10 23:30:05,643 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:30:05,644 INFO L432 NwaCegarLoop]: 1813 mSDtfsCounter, 805 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2558 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 1956 SdHoareTripleChecker+Invalid, 3281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 2558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:30:05,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 1956 Invalid, 3281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 2558 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-10 23:30:05,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75171 states. [2024-10-10 23:30:06,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75171 to 74379. [2024-10-10 23:30:06,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74379 states, 74378 states have (on average 1.1514291860496384) internal successors, (85641), 74378 states have internal predecessors, (85641), 0 states have call successors, (0), 0 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:30:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74379 states to 74379 states and 85641 transitions. [2024-10-10 23:30:06,604 INFO L78 Accepts]: Start accepts. Automaton has 74379 states and 85641 transitions. Word has length 346 [2024-10-10 23:30:06,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:30:06,605 INFO L471 AbstractCegarLoop]: Abstraction has 74379 states and 85641 transitions. [2024-10-10 23:30:06,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 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:30:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 74379 states and 85641 transitions. [2024-10-10 23:30:06,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2024-10-10 23:30:06,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:06,613 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:30:06,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:30:06,614 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:06,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:06,614 INFO L85 PathProgramCache]: Analyzing trace with hash -729542348, now seen corresponding path program 1 times [2024-10-10 23:30:06,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:06,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989755013] [2024-10-10 23:30:06,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:06,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 236 proven. 113 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-10 23:30:08,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:08,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989755013] [2024-10-10 23:30:08,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989755013] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:30:08,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123109807] [2024-10-10 23:30:08,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:08,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:30:08,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:30:08,614 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:30:08,615 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:30:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:08,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:30:08,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:30:08,931 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-10 23:30:08,931 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:30:08,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123109807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:08,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:30:08,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-10 23:30:08,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403131626] [2024-10-10 23:30:08,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:08,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:30:08,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:08,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:30:08,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:30:08,934 INFO L87 Difference]: Start difference. First operand 74379 states and 85641 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 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:30:12,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:30:12,006 INFO L93 Difference]: Finished difference Result 147961 states and 170481 transitions. [2024-10-10 23:30:12,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:30:12,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 361 [2024-10-10 23:30:12,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:30:12,112 INFO L225 Difference]: With dead ends: 147961 [2024-10-10 23:30:12,113 INFO L226 Difference]: Without dead ends: 74370 [2024-10-10 23:30:12,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:30:12,165 INFO L432 NwaCegarLoop]: 687 mSDtfsCounter, 1077 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 2923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:30:12,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 815 Invalid, 2923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2396 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:30:12,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74370 states. [2024-10-10 23:30:12,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74370 to 74369. [2024-10-10 23:30:12,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74369 states, 74368 states have (on average 1.113086273666093) internal successors, (82778), 74368 states have internal predecessors, (82778), 0 states have call successors, (0), 0 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:30:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74369 states to 74369 states and 82778 transitions. [2024-10-10 23:30:13,073 INFO L78 Accepts]: Start accepts. Automaton has 74369 states and 82778 transitions. Word has length 361 [2024-10-10 23:30:13,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:30:13,073 INFO L471 AbstractCegarLoop]: Abstraction has 74369 states and 82778 transitions. [2024-10-10 23:30:13,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 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:30:13,074 INFO L276 IsEmpty]: Start isEmpty. Operand 74369 states and 82778 transitions. [2024-10-10 23:30:13,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2024-10-10 23:30:13,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:13,298 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, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:30:13,337 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:30:13,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-10 23:30:13,499 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:13,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:13,500 INFO L85 PathProgramCache]: Analyzing trace with hash 221345827, now seen corresponding path program 1 times [2024-10-10 23:30:13,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:13,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086926023] [2024-10-10 23:30:13,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:13,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:14,249 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2024-10-10 23:30:14,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:14,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086926023] [2024-10-10 23:30:14,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086926023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:14,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:30:14,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:30:14,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087405696] [2024-10-10 23:30:14,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:14,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:30:14,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:14,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:30:14,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:30:14,252 INFO L87 Difference]: Start difference. First operand 74369 states and 82778 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 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:30:17,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:30:17,755 INFO L93 Difference]: Finished difference Result 145586 states and 162050 transitions. [2024-10-10 23:30:17,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:30:17,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 380 [2024-10-10 23:30:17,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:30:17,867 INFO L225 Difference]: With dead ends: 145586 [2024-10-10 23:30:17,868 INFO L226 Difference]: Without dead ends: 72005 [2024-10-10 23:30:17,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:30:17,884 INFO L432 NwaCegarLoop]: 1340 mSDtfsCounter, 1146 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2464 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 2908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:30:17,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 1418 Invalid, 2908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2464 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-10 23:30:17,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72005 states. [2024-10-10 23:30:18,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72005 to 72004. [2024-10-10 23:30:18,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72004 states, 72003 states have (on average 1.0866630557060122) internal successors, (78243), 72003 states have internal predecessors, (78243), 0 states have call successors, (0), 0 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:30:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72004 states to 72004 states and 78243 transitions. [2024-10-10 23:30:18,892 INFO L78 Accepts]: Start accepts. Automaton has 72004 states and 78243 transitions. Word has length 380 [2024-10-10 23:30:18,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:30:18,893 INFO L471 AbstractCegarLoop]: Abstraction has 72004 states and 78243 transitions. [2024-10-10 23:30:18,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 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:30:18,894 INFO L276 IsEmpty]: Start isEmpty. Operand 72004 states and 78243 transitions. [2024-10-10 23:30:18,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2024-10-10 23:30:18,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:18,903 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, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:30:18,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:30:18,903 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:18,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:18,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1248383698, now seen corresponding path program 1 times [2024-10-10 23:30:18,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:18,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475439429] [2024-10-10 23:30:18,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:18,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:19,424 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 498 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-10-10 23:30:19,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:19,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475439429] [2024-10-10 23:30:19,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475439429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:19,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:30:19,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:30:19,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69254380] [2024-10-10 23:30:19,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:19,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:30:19,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:19,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:30:19,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:30:19,427 INFO L87 Difference]: Start difference. First operand 72004 states and 78243 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 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:30:25,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:30:25,917 INFO L93 Difference]: Finished difference Result 195374 states and 213137 transitions. [2024-10-10 23:30:25,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:30:25,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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 403 [2024-10-10 23:30:25,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:30:26,059 INFO L225 Difference]: With dead ends: 195374 [2024-10-10 23:30:26,060 INFO L226 Difference]: Without dead ends: 124158 [2024-10-10 23:30:26,083 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:30:26,084 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 1718 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 6002 mSolverCounterSat, 1097 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1718 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 7099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1097 IncrementalHoareTripleChecker+Valid, 6002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:30:26,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1718 Valid, 744 Invalid, 7099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1097 Valid, 6002 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-10 23:30:26,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124158 states. [2024-10-10 23:30:27,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124158 to 121666. [2024-10-10 23:30:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121666 states, 121665 states have (on average 1.0846093782106605) internal successors, (131959), 121665 states have internal predecessors, (131959), 0 states have call successors, (0), 0 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:30:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121666 states to 121666 states and 131959 transitions. [2024-10-10 23:30:27,527 INFO L78 Accepts]: Start accepts. Automaton has 121666 states and 131959 transitions. Word has length 403 [2024-10-10 23:30:27,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:30:27,527 INFO L471 AbstractCegarLoop]: Abstraction has 121666 states and 131959 transitions. [2024-10-10 23:30:27,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 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:30:27,528 INFO L276 IsEmpty]: Start isEmpty. Operand 121666 states and 131959 transitions. [2024-10-10 23:30:27,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2024-10-10 23:30:27,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:27,536 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, 5, 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, 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:30:27,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:30:27,537 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:27,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:27,537 INFO L85 PathProgramCache]: Analyzing trace with hash 595943428, now seen corresponding path program 1 times [2024-10-10 23:30:27,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:27,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959256553] [2024-10-10 23:30:27,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:27,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 409 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-10 23:30:28,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:28,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959256553] [2024-10-10 23:30:28,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959256553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:28,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:30:28,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:30:28,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465453192] [2024-10-10 23:30:28,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:28,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:30:28,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:28,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:30:28,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:30:28,287 INFO L87 Difference]: Start difference. First operand 121666 states and 131959 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 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:30:32,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:30:32,003 INFO L93 Difference]: Finished difference Result 274839 states and 297847 transitions. [2024-10-10 23:30:32,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:30:32,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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:30:32,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:30:32,195 INFO L225 Difference]: With dead ends: 274839 [2024-10-10 23:30:32,195 INFO L226 Difference]: Without dead ends: 153961 [2024-10-10 23:30:32,223 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:30:32,224 INFO L432 NwaCegarLoop]: 995 mSDtfsCounter, 794 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 2481 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 2854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 2481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:30:32,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1136 Invalid, 2854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 2481 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 23:30:32,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153961 states.