./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/Problem17_label53.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/Problem17_label53.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 1a38205e3959e6525b83c93048d4c167030358e78fc3e837355c804b08f2636e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:49:09,632 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:49:09,695 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:49:09,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:49:09,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:49:09,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:49:09,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:49:09,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:49:09,737 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:49:09,739 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:49:09,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:49:09,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:49:09,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:49:09,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:49:09,742 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:49:09,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:49:09,743 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:49:09,743 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:49:09,743 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:49:09,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:49:09,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:49:09,746 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:49:09,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:49:09,746 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:49:09,746 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:49:09,747 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:49:09,747 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:49:09,747 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:49:09,747 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:49:09,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:49:09,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:49:09,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:49:09,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:49:09,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:49:09,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:49:09,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:49:09,750 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:49:09,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:49:09,750 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:49:09,751 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:49:09,751 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:49:09,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:49:09,752 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 -> 1a38205e3959e6525b83c93048d4c167030358e78fc3e837355c804b08f2636e [2024-10-10 23:49:09,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:49:10,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:49:10,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:49:10,018 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:49:10,018 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:49:10,019 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label53.c [2024-10-10 23:49:11,436 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:49:11,844 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:49:11,845 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label53.c [2024-10-10 23:49:11,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cdbd00cf6/e619f8deb6f74eec89295edf44412f56/FLAGd84b457f4 [2024-10-10 23:49:12,053 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cdbd00cf6/e619f8deb6f74eec89295edf44412f56 [2024-10-10 23:49:12,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:49:12,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:49:12,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:49:12,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:49:12,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:49:12,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:49:12" (1/1) ... [2024-10-10 23:49:12,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22d7590c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:12, skipping insertion in model container [2024-10-10 23:49:12,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:49:12" (1/1) ... [2024-10-10 23:49:12,156 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:49:12,397 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/Problem17_label53.c[2227,2240] [2024-10-10 23:49:12,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:49:12,951 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:49:12,973 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/Problem17_label53.c[2227,2240] [2024-10-10 23:49:13,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:49:13,303 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:49:13,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:13 WrapperNode [2024-10-10 23:49:13,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:49:13,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:49:13,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:49:13,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:49:13,312 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:49:13" (1/1) ... [2024-10-10 23:49:13,367 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:49:13" (1/1) ... [2024-10-10 23:49:13,598 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-10 23:49:13,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:49:13,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:49:13,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:49:13,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:49:13,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:13" (1/1) ... [2024-10-10 23:49:13,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:13" (1/1) ... [2024-10-10 23:49:13,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:13" (1/1) ... [2024-10-10 23:49:13,858 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:49:13,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:13" (1/1) ... [2024-10-10 23:49:13,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:13" (1/1) ... [2024-10-10 23:49:14,011 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:13" (1/1) ... [2024-10-10 23:49:14,025 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:13" (1/1) ... [2024-10-10 23:49:14,060 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:13" (1/1) ... [2024-10-10 23:49:14,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:13" (1/1) ... [2024-10-10 23:49:14,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:49:14,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:49:14,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:49:14,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:49:14,130 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:13" (1/1) ... [2024-10-10 23:49:14,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:49:14,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:49:14,163 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:49:14,167 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:49:14,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:49:14,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:49:14,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:49:14,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:49:14,272 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:49:14,274 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:49:17,457 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-10 23:49:17,457 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:49:17,512 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:49:17,513 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:49:17,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:49:17 BoogieIcfgContainer [2024-10-10 23:49:17,513 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:49:17,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:49:17,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:49:17,519 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:49:17,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:49:12" (1/3) ... [2024-10-10 23:49:17,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e420be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:49:17, skipping insertion in model container [2024-10-10 23:49:17,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:49:13" (2/3) ... [2024-10-10 23:49:17,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e420be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:49:17, skipping insertion in model container [2024-10-10 23:49:17,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:49:17" (3/3) ... [2024-10-10 23:49:17,523 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label53.c [2024-10-10 23:49:17,538 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:49:17,539 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:49:17,632 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:49:17,639 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;@4d3f739a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:49:17,639 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:49:17,646 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 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:49:17,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-10 23:49:17,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:17,655 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:17,655 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:17,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:17,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1154787478, now seen corresponding path program 1 times [2024-10-10 23:49:17,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:17,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954598024] [2024-10-10 23:49:17,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:17,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:17,821 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:49:17,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:17,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954598024] [2024-10-10 23:49:17,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954598024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:17,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:17,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:49:17,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396115334] [2024-10-10 23:49:17,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:17,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:49:17,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:17,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:49:17,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:49:17,857 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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:49:17,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:17,956 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-10 23:49:17,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:49:17,962 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-10-10 23:49:17,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:17,978 INFO L225 Difference]: With dead ends: 1055 [2024-10-10 23:49:17,978 INFO L226 Difference]: Without dead ends: 526 [2024-10-10 23:49:17,984 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:49:17,989 INFO L432 NwaCegarLoop]: 935 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, 935 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:49:17,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:49:18,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-10 23:49:18,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-10 23:49:18,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 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:49:18,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-10 23:49:18,062 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 13 [2024-10-10 23:49:18,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:18,063 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-10 23:49:18,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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:49:18,063 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-10 23:49:18,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-10 23:49:18,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:18,064 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:18,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:49:18,065 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:18,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:18,065 INFO L85 PathProgramCache]: Analyzing trace with hash 339474226, now seen corresponding path program 1 times [2024-10-10 23:49:18,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:18,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152817239] [2024-10-10 23:49:18,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:18,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:18,175 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:49:18,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:18,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152817239] [2024-10-10 23:49:18,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152817239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:18,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:18,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:49:18,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517109389] [2024-10-10 23:49:18,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:18,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:18,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:18,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:18,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:18,181 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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:49:20,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:20,308 INFO L93 Difference]: Finished difference Result 1501 states and 2698 transitions. [2024-10-10 23:49:20,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:20,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-10-10 23:49:20,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:20,318 INFO L225 Difference]: With dead ends: 1501 [2024-10-10 23:49:20,320 INFO L226 Difference]: Without dead ends: 976 [2024-10-10 23:49:20,321 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:49:20,322 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 458 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:20,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 448 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:49:20,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-10 23:49:20,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 970. [2024-10-10 23:49:20,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 1.5541795665634675) internal successors, (1506), 969 states have internal predecessors, (1506), 0 states have call successors, (0), 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:49:20,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1506 transitions. [2024-10-10 23:49:20,355 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1506 transitions. Word has length 13 [2024-10-10 23:49:20,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:20,356 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1506 transitions. [2024-10-10 23:49:20,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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:49:20,356 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1506 transitions. [2024-10-10 23:49:20,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-10 23:49:20,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:20,359 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:20,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:49:20,359 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:20,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:20,360 INFO L85 PathProgramCache]: Analyzing trace with hash 222604954, now seen corresponding path program 1 times [2024-10-10 23:49:20,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:20,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212800586] [2024-10-10 23:49:20,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:20,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:20,631 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:49:20,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:20,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212800586] [2024-10-10 23:49:20,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212800586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:20,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:20,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:49:20,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479425274] [2024-10-10 23:49:20,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:20,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:20,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:20,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:20,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:20,635 INFO L87 Difference]: Start difference. First operand 970 states and 1506 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 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:49:22,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:22,636 INFO L93 Difference]: Finished difference Result 2814 states and 4381 transitions. [2024-10-10 23:49:22,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:22,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-10-10 23:49:22,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:22,643 INFO L225 Difference]: With dead ends: 2814 [2024-10-10 23:49:22,643 INFO L226 Difference]: Without dead ends: 1845 [2024-10-10 23:49:22,644 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:49:22,645 INFO L432 NwaCegarLoop]: 505 mSDtfsCounter, 407 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:22,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 578 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:49:22,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2024-10-10 23:49:22,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1840. [2024-10-10 23:49:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1839 states have (on average 1.3507340946166395) internal successors, (2484), 1839 states have internal predecessors, (2484), 0 states have call successors, (0), 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:49:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2484 transitions. [2024-10-10 23:49:22,681 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2484 transitions. Word has length 80 [2024-10-10 23:49:22,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:22,682 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2484 transitions. [2024-10-10 23:49:22,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 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:49:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2484 transitions. [2024-10-10 23:49:22,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-10 23:49:22,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:22,685 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:49:22,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:49:22,685 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:22,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:22,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1781845506, now seen corresponding path program 1 times [2024-10-10 23:49:22,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:22,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407778683] [2024-10-10 23:49:22,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:22,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:22,879 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:49:22,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:22,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407778683] [2024-10-10 23:49:22,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407778683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:22,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:22,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:22,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180769192] [2024-10-10 23:49:22,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:22,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:22,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:22,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:22,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:22,883 INFO L87 Difference]: Start difference. First operand 1840 states and 2484 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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:49:25,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:25,117 INFO L93 Difference]: Finished difference Result 4551 states and 6284 transitions. [2024-10-10 23:49:25,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:25,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-10-10 23:49:25,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:25,127 INFO L225 Difference]: With dead ends: 4551 [2024-10-10 23:49:25,127 INFO L226 Difference]: Without dead ends: 2712 [2024-10-10 23:49:25,130 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:49:25,132 INFO L432 NwaCegarLoop]: 816 mSDtfsCounter, 493 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:25,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 883 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:49:25,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2024-10-10 23:49:25,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 2710. [2024-10-10 23:49:25,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2710 states, 2709 states have (on average 1.3008490217792543) internal successors, (3524), 2709 states have internal predecessors, (3524), 0 states have call successors, (0), 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:49:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3524 transitions. [2024-10-10 23:49:25,187 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3524 transitions. Word has length 83 [2024-10-10 23:49:25,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:25,188 INFO L471 AbstractCegarLoop]: Abstraction has 2710 states and 3524 transitions. [2024-10-10 23:49:25,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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:49:25,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3524 transitions. [2024-10-10 23:49:25,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-10 23:49:25,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:25,195 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:25,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:49:25,195 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:25,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:25,196 INFO L85 PathProgramCache]: Analyzing trace with hash -952286071, now seen corresponding path program 1 times [2024-10-10 23:49:25,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:25,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313105290] [2024-10-10 23:49:25,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:25,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:25,522 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-10 23:49:25,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:25,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313105290] [2024-10-10 23:49:25,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313105290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:25,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:25,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:49:25,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136119085] [2024-10-10 23:49:25,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:25,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:25,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:25,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:25,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:25,525 INFO L87 Difference]: Start difference. First operand 2710 states and 3524 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 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:49:27,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:27,129 INFO L93 Difference]: Finished difference Result 7983 states and 10363 transitions. [2024-10-10 23:49:27,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:27,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 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 152 [2024-10-10 23:49:27,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:27,145 INFO L225 Difference]: With dead ends: 7983 [2024-10-10 23:49:27,145 INFO L226 Difference]: Without dead ends: 4420 [2024-10-10 23:49:27,151 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:49:27,156 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:27,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 589 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:49:27,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4420 states. [2024-10-10 23:49:27,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4420 to 3565. [2024-10-10 23:49:27,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3565 states, 3564 states have (on average 1.1778900112233446) internal successors, (4198), 3564 states have internal predecessors, (4198), 0 states have call successors, (0), 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:49:27,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 3565 states and 4198 transitions. [2024-10-10 23:49:27,258 INFO L78 Accepts]: Start accepts. Automaton has 3565 states and 4198 transitions. Word has length 152 [2024-10-10 23:49:27,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:27,259 INFO L471 AbstractCegarLoop]: Abstraction has 3565 states and 4198 transitions. [2024-10-10 23:49:27,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 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:49:27,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3565 states and 4198 transitions. [2024-10-10 23:49:27,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-10 23:49:27,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:27,266 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:27,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:49:27,266 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:27,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:27,267 INFO L85 PathProgramCache]: Analyzing trace with hash 621062677, now seen corresponding path program 1 times [2024-10-10 23:49:27,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:27,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250287200] [2024-10-10 23:49:27,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:27,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:27,466 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:49:27,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:27,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250287200] [2024-10-10 23:49:27,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250287200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:27,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:27,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:27,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441671051] [2024-10-10 23:49:27,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:27,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:27,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:27,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:27,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:27,470 INFO L87 Difference]: Start difference. First operand 3565 states and 4198 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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:49:28,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:28,883 INFO L93 Difference]: Finished difference Result 9262 states and 11077 transitions. [2024-10-10 23:49:28,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:28,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2024-10-10 23:49:28,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:28,900 INFO L225 Difference]: With dead ends: 9262 [2024-10-10 23:49:28,900 INFO L226 Difference]: Without dead ends: 5698 [2024-10-10 23:49:28,906 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:49:28,907 INFO L432 NwaCegarLoop]: 724 mSDtfsCounter, 496 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:28,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 781 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:49:28,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5698 states. [2024-10-10 23:49:28,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5698 to 5698. [2024-10-10 23:49:28,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5698 states, 5697 states have (on average 1.1597331929085484) internal successors, (6607), 5697 states have internal predecessors, (6607), 0 states have call successors, (0), 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:49:28,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5698 states to 5698 states and 6607 transitions. [2024-10-10 23:49:28,994 INFO L78 Accepts]: Start accepts. Automaton has 5698 states and 6607 transitions. Word has length 165 [2024-10-10 23:49:28,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:28,998 INFO L471 AbstractCegarLoop]: Abstraction has 5698 states and 6607 transitions. [2024-10-10 23:49:28,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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:49:28,998 INFO L276 IsEmpty]: Start isEmpty. Operand 5698 states and 6607 transitions. [2024-10-10 23:49:28,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-10 23:49:28,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:29,000 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:29,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:49:29,000 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:29,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:29,001 INFO L85 PathProgramCache]: Analyzing trace with hash 61230928, now seen corresponding path program 1 times [2024-10-10 23:49:29,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:29,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526128767] [2024-10-10 23:49:29,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:29,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:29,351 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 23 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:49:29,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:29,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526128767] [2024-10-10 23:49:29,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526128767] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:49:29,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218493260] [2024-10-10 23:49:29,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:29,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:49:29,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:49:29,354 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:49:29,358 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:49:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:29,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 23:49:29,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:49:29,723 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 23 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:49:29,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:49:30,026 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:49:30,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218493260] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:49:30,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:49:30,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-10-10 23:49:30,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434021698] [2024-10-10 23:49:30,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:30,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:49:30,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:30,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:49:30,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:49:30,029 INFO L87 Difference]: Start difference. First operand 5698 states and 6607 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:32,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:32,814 INFO L93 Difference]: Finished difference Result 16960 states and 19952 transitions. [2024-10-10 23:49:32,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:49:32,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2024-10-10 23:49:32,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:32,841 INFO L225 Difference]: With dead ends: 16960 [2024-10-10 23:49:32,841 INFO L226 Difference]: Without dead ends: 10383 [2024-10-10 23:49:32,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:49:32,852 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 1048 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2184 mSolverCounterSat, 1043 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 3227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1043 IncrementalHoareTripleChecker+Valid, 2184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:32,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 149 Invalid, 3227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1043 Valid, 2184 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:49:32,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10383 states. [2024-10-10 23:49:32,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10383 to 10378. [2024-10-10 23:49:32,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10378 states, 10377 states have (on average 1.1553435482316663) internal successors, (11989), 10377 states have internal predecessors, (11989), 0 states have call successors, (0), 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:49:33,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10378 states to 10378 states and 11989 transitions. [2024-10-10 23:49:33,009 INFO L78 Accepts]: Start accepts. Automaton has 10378 states and 11989 transitions. Word has length 167 [2024-10-10 23:49:33,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:33,010 INFO L471 AbstractCegarLoop]: Abstraction has 10378 states and 11989 transitions. [2024-10-10 23:49:33,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:33,010 INFO L276 IsEmpty]: Start isEmpty. Operand 10378 states and 11989 transitions. [2024-10-10 23:49:33,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-10 23:49:33,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:33,013 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:33,031 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:49:33,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:49:33,214 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:33,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:33,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1385349746, now seen corresponding path program 1 times [2024-10-10 23:49:33,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:33,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917319584] [2024-10-10 23:49:33,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:33,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:33,749 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 35 proven. 214 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:49:33,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:33,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917319584] [2024-10-10 23:49:33,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917319584] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:49:33,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173778954] [2024-10-10 23:49:33,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:33,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:49:33,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:49:33,753 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:49:33,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:49:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:33,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 23:49:33,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:49:34,135 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 164 proven. 73 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 23:49:34,137 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:49:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 23:49:34,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173778954] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:49:34,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:49:34,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2024-10-10 23:49:34,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050228384] [2024-10-10 23:49:34,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:34,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:49:34,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:34,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:49:34,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:49:34,428 INFO L87 Difference]: Start difference. First operand 10378 states and 11989 transitions. Second operand has 4 states, 4 states have (on average 57.5) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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:49:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:36,799 INFO L93 Difference]: Finished difference Result 28864 states and 33387 transitions. [2024-10-10 23:49:36,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:49:36,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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 241 [2024-10-10 23:49:36,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:36,835 INFO L225 Difference]: With dead ends: 28864 [2024-10-10 23:49:36,835 INFO L226 Difference]: Without dead ends: 18487 [2024-10-10 23:49:36,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 479 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:49:36,850 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 839 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 2781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:36,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 183 Invalid, 2781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 2269 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:49:36,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18487 states. [2024-10-10 23:49:37,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18487 to 18481. [2024-10-10 23:49:37,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18481 states, 18480 states have (on average 1.1429112554112555) internal successors, (21121), 18480 states have internal predecessors, (21121), 0 states have call successors, (0), 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:49:37,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18481 states to 18481 states and 21121 transitions. [2024-10-10 23:49:37,160 INFO L78 Accepts]: Start accepts. Automaton has 18481 states and 21121 transitions. Word has length 241 [2024-10-10 23:49:37,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:37,160 INFO L471 AbstractCegarLoop]: Abstraction has 18481 states and 21121 transitions. [2024-10-10 23:49:37,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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:49:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 18481 states and 21121 transitions. [2024-10-10 23:49:37,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2024-10-10 23:49:37,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:37,169 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:37,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:49:37,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:49:37,370 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:37,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:37,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1641664788, now seen corresponding path program 1 times [2024-10-10 23:49:37,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:37,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845262182] [2024-10-10 23:49:37,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:37,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:37,780 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-10-10 23:49:37,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:37,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845262182] [2024-10-10 23:49:37,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845262182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:37,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:37,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:37,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188449767] [2024-10-10 23:49:37,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:37,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:37,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:37,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:37,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:37,786 INFO L87 Difference]: Start difference. First operand 18481 states and 21121 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:49:39,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:39,576 INFO L93 Difference]: Finished difference Result 50633 states and 57337 transitions. [2024-10-10 23:49:39,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:39,577 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 346 [2024-10-10 23:49:39,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:39,637 INFO L225 Difference]: With dead ends: 50633 [2024-10-10 23:49:39,637 INFO L226 Difference]: Without dead ends: 32153 [2024-10-10 23:49:39,664 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:49:39,667 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 426 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:39,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 665 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:49:39,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32153 states. [2024-10-10 23:49:40,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32153 to 29569. [2024-10-10 23:49:40,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29569 states, 29568 states have (on average 1.1311214826839826) internal successors, (33445), 29568 states have internal predecessors, (33445), 0 states have call successors, (0), 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:49:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29569 states to 29569 states and 33445 transitions. [2024-10-10 23:49:40,197 INFO L78 Accepts]: Start accepts. Automaton has 29569 states and 33445 transitions. Word has length 346 [2024-10-10 23:49:40,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:40,198 INFO L471 AbstractCegarLoop]: Abstraction has 29569 states and 33445 transitions. [2024-10-10 23:49:40,198 INFO L472 AbstractCegarLoop]: INTERPOLANT 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) [2024-10-10 23:49:40,199 INFO L276 IsEmpty]: Start isEmpty. Operand 29569 states and 33445 transitions. [2024-10-10 23:49:40,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-10-10 23:49:40,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:40,207 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:40,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:49:40,207 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:40,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:40,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1942632305, now seen corresponding path program 1 times [2024-10-10 23:49:40,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:40,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837170971] [2024-10-10 23:49:40,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:40,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-10-10 23:49:40,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:40,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837170971] [2024-10-10 23:49:40,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837170971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:40,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:40,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:40,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516238901] [2024-10-10 23:49:40,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:40,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:40,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:40,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:40,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:40,563 INFO L87 Difference]: Start difference. First operand 29569 states and 33445 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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:49:42,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:42,343 INFO L93 Difference]: Finished difference Result 68518 states and 77906 transitions. [2024-10-10 23:49:42,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:42,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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 347 [2024-10-10 23:49:42,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:42,427 INFO L225 Difference]: With dead ends: 68518 [2024-10-10 23:49:42,427 INFO L226 Difference]: Without dead ends: 38949 [2024-10-10 23:49:42,459 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:49:42,460 INFO L432 NwaCegarLoop]: 601 mSDtfsCounter, 436 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:42,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 638 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:49:42,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38949 states. [2024-10-10 23:49:42,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38949 to 36817. [2024-10-10 23:49:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36817 states, 36816 states have (on average 1.1341264667535853) internal successors, (41754), 36816 states have internal predecessors, (41754), 0 states have call successors, (0), 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:49:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36817 states to 36817 states and 41754 transitions. [2024-10-10 23:49:43,050 INFO L78 Accepts]: Start accepts. Automaton has 36817 states and 41754 transitions. Word has length 347 [2024-10-10 23:49:43,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:43,051 INFO L471 AbstractCegarLoop]: Abstraction has 36817 states and 41754 transitions. [2024-10-10 23:49:43,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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:49:43,051 INFO L276 IsEmpty]: Start isEmpty. Operand 36817 states and 41754 transitions. [2024-10-10 23:49:43,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-10 23:49:43,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:43,060 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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:49:43,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:49:43,061 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:43,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:43,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1603318760, now seen corresponding path program 1 times [2024-10-10 23:49:43,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:43,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192047867] [2024-10-10 23:49:43,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:43,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:43,729 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 23:49:43,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:43,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192047867] [2024-10-10 23:49:43,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192047867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:43,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:43,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:49:43,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645346634] [2024-10-10 23:49:43,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:43,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:49:43,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:43,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:49:43,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:49:43,732 INFO L87 Difference]: Start difference. First operand 36817 states and 41754 transitions. Second operand has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 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:49:46,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:46,158 INFO L93 Difference]: Finished difference Result 99667 states and 112881 transitions. [2024-10-10 23:49:46,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:49:46,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 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 351 [2024-10-10 23:49:46,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:46,367 INFO L225 Difference]: With dead ends: 99667 [2024-10-10 23:49:46,367 INFO L226 Difference]: Without dead ends: 62851 [2024-10-10 23:49:46,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:49:46,438 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 826 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 2312 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 2755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:46,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 189 Invalid, 2755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2312 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:49:46,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62851 states. [2024-10-10 23:49:47,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62851 to 57735. [2024-10-10 23:49:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57735 states, 57734 states have (on average 1.1359684068313298) internal successors, (65584), 57734 states have internal predecessors, (65584), 0 states have call successors, (0), 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:49:47,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57735 states to 57735 states and 65584 transitions. [2024-10-10 23:49:47,524 INFO L78 Accepts]: Start accepts. Automaton has 57735 states and 65584 transitions. Word has length 351 [2024-10-10 23:49:47,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:47,525 INFO L471 AbstractCegarLoop]: Abstraction has 57735 states and 65584 transitions. [2024-10-10 23:49:47,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 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:49:47,525 INFO L276 IsEmpty]: Start isEmpty. Operand 57735 states and 65584 transitions. [2024-10-10 23:49:47,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-10-10 23:49:47,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:47,530 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:47,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:49:47,530 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:47,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:47,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1952295752, now seen corresponding path program 1 times [2024-10-10 23:49:47,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:47,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095616959] [2024-10-10 23:49:47,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:47,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:47,935 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:49:47,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:47,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095616959] [2024-10-10 23:49:47,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095616959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:47,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:47,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:47,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239954816] [2024-10-10 23:49:47,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:47,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:49:47,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:47,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:49:47,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:49:47,938 INFO L87 Difference]: Start difference. First operand 57735 states and 65584 transitions. Second operand has 4 states, 4 states have (on average 88.0) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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:49:50,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:50,537 INFO L93 Difference]: Finished difference Result 138520 states and 157085 transitions. [2024-10-10 23:49:50,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:49:50,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.0) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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 352 [2024-10-10 23:49:50,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:50,638 INFO L225 Difference]: With dead ends: 138520 [2024-10-10 23:49:50,638 INFO L226 Difference]: Without dead ends: 78657 [2024-10-10 23:49:50,690 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:49:50,690 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 557 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 2717 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 2891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 2717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:50,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 396 Invalid, 2891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 2717 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:49:50,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78657 states. [2024-10-10 23:49:51,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78657 to 77347. [2024-10-10 23:49:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77347 states, 77346 states have (on average 1.1266904558736068) internal successors, (87145), 77346 states have internal predecessors, (87145), 0 states have call successors, (0), 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:49:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77347 states to 77347 states and 87145 transitions. [2024-10-10 23:49:51,947 INFO L78 Accepts]: Start accepts. Automaton has 77347 states and 87145 transitions. Word has length 352 [2024-10-10 23:49:51,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:51,948 INFO L471 AbstractCegarLoop]: Abstraction has 77347 states and 87145 transitions. [2024-10-10 23:49:51,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.0) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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:49:51,948 INFO L276 IsEmpty]: Start isEmpty. Operand 77347 states and 87145 transitions. [2024-10-10 23:49:51,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2024-10-10 23:49:51,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:51,961 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:51,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:49:51,962 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:51,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:51,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1963005406, now seen corresponding path program 1 times [2024-10-10 23:49:51,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:51,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652375869] [2024-10-10 23:49:51,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:51,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 311 proven. 82 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-10 23:49:53,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:53,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652375869] [2024-10-10 23:49:53,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652375869] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:49:53,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305964653] [2024-10-10 23:49:53,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:53,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:49:53,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:49:53,261 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:49:53,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:49:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:53,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-10 23:49:53,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:49:54,767 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 311 proven. 82 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-10 23:49:54,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:49:55,702 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 392 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-10 23:49:55,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305964653] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:49:55,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:49:55,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2024-10-10 23:49:55,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349773853] [2024-10-10 23:49:55,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:49:55,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 23:49:55,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:55,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 23:49:55,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-10 23:49:55,706 INFO L87 Difference]: Start difference. First operand 77347 states and 87145 transitions. Second operand has 10 states, 10 states have (on average 61.5) internal successors, (615), 9 states have internal predecessors, (615), 0 states have call successors, (0), 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:50:00,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:00,506 INFO L93 Difference]: Finished difference Result 171937 states and 193624 transitions. [2024-10-10 23:50:00,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-10 23:50:00,506 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 61.5) internal successors, (615), 9 states have internal predecessors, (615), 0 states have call successors, (0), 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 366 [2024-10-10 23:50:00,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:00,605 INFO L225 Difference]: With dead ends: 171937 [2024-10-10 23:50:00,606 INFO L226 Difference]: Without dead ends: 94591 [2024-10-10 23:50:00,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 727 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-10 23:50:00,652 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 2910 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 6025 mSolverCounterSat, 884 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2910 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 6909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 884 IncrementalHoareTripleChecker+Valid, 6025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:00,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2910 Valid, 383 Invalid, 6909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [884 Valid, 6025 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-10 23:50:00,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94591 states. [2024-10-10 23:50:01,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94591 to 82426. [2024-10-10 23:50:02,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82426 states, 82425 states have (on average 1.1208007279344858) internal successors, (92382), 82425 states have internal predecessors, (92382), 0 states have call successors, (0), 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:50:02,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82426 states to 82426 states and 92382 transitions. [2024-10-10 23:50:02,137 INFO L78 Accepts]: Start accepts. Automaton has 82426 states and 92382 transitions. Word has length 366 [2024-10-10 23:50:02,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:02,137 INFO L471 AbstractCegarLoop]: Abstraction has 82426 states and 92382 transitions. [2024-10-10 23:50:02,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 61.5) internal successors, (615), 9 states have internal predecessors, (615), 0 states have call successors, (0), 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:50:02,138 INFO L276 IsEmpty]: Start isEmpty. Operand 82426 states and 92382 transitions. [2024-10-10 23:50:02,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2024-10-10 23:50:02,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:02,146 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:50:02,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 23:50:02,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:50:02,348 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:02,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:02,348 INFO L85 PathProgramCache]: Analyzing trace with hash -293468210, now seen corresponding path program 1 times [2024-10-10 23:50:02,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:02,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105750129] [2024-10-10 23:50:02,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:02,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:03,072 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 551 proven. 0 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2024-10-10 23:50:03,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:03,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105750129] [2024-10-10 23:50:03,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105750129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:03,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:03,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:50:03,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841423409] [2024-10-10 23:50:03,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:03,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:03,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:03,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:03,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:03,076 INFO L87 Difference]: Start difference. First operand 82426 states and 92382 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 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:50:05,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:05,198 INFO L93 Difference]: Finished difference Result 189116 states and 212184 transitions. [2024-10-10 23:50:05,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:05,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 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 426 [2024-10-10 23:50:05,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:05,316 INFO L225 Difference]: With dead ends: 189116 [2024-10-10 23:50:05,316 INFO L226 Difference]: Without dead ends: 106689 [2024-10-10 23:50:05,339 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:50:05,340 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 437 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:05,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 350 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:50:05,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106689 states. [2024-10-10 23:50:06,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106689 to 101985. [2024-10-10 23:50:06,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101985 states, 101984 states have (on average 1.1074972544712895) internal successors, (112947), 101984 states have internal predecessors, (112947), 0 states have call successors, (0), 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:50:06,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101985 states to 101985 states and 112947 transitions. [2024-10-10 23:50:06,930 INFO L78 Accepts]: Start accepts. Automaton has 101985 states and 112947 transitions. Word has length 426 [2024-10-10 23:50:06,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:06,931 INFO L471 AbstractCegarLoop]: Abstraction has 101985 states and 112947 transitions. [2024-10-10 23:50:06,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 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:50:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 101985 states and 112947 transitions. [2024-10-10 23:50:06,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2024-10-10 23:50:06,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:06,951 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:50:06,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:50:06,952 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:06,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:06,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1761150843, now seen corresponding path program 1 times [2024-10-10 23:50:06,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:06,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724047038] [2024-10-10 23:50:06,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:06,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 632 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-10 23:50:07,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:07,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724047038] [2024-10-10 23:50:07,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724047038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:07,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:07,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:50:07,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351930328] [2024-10-10 23:50:07,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:07,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:07,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:07,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:07,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:07,774 INFO L87 Difference]: Start difference. First operand 101985 states and 112947 transitions. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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:50:09,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:09,802 INFO L93 Difference]: Finished difference Result 216326 states and 239211 transitions. [2024-10-10 23:50:09,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:09,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 448 [2024-10-10 23:50:09,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:09,949 INFO L225 Difference]: With dead ends: 216326 [2024-10-10 23:50:09,949 INFO L226 Difference]: Without dead ends: 114342 [2024-10-10 23:50:10,015 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:50:10,016 INFO L432 NwaCegarLoop]: 713 mSDtfsCounter, 335 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:10,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 765 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:50:10,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114342 states. [2024-10-10 23:50:11,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114342 to 110496. [2024-10-10 23:50:11,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110496 states, 110495 states have (on average 1.101153898366442) internal successors, (121672), 110495 states have internal predecessors, (121672), 0 states have call successors, (0), 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:50:11,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110496 states to 110496 states and 121672 transitions. [2024-10-10 23:50:11,733 INFO L78 Accepts]: Start accepts. Automaton has 110496 states and 121672 transitions. Word has length 448 [2024-10-10 23:50:11,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:11,733 INFO L471 AbstractCegarLoop]: Abstraction has 110496 states and 121672 transitions. [2024-10-10 23:50:11,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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:50:11,734 INFO L276 IsEmpty]: Start isEmpty. Operand 110496 states and 121672 transitions. [2024-10-10 23:50:11,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2024-10-10 23:50:11,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:11,741 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:50:11,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:50:11,741 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:11,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:11,742 INFO L85 PathProgramCache]: Analyzing trace with hash -836688104, now seen corresponding path program 1 times [2024-10-10 23:50:11,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:11,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818741724] [2024-10-10 23:50:11,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:11,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2024-10-10 23:50:11,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:11,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818741724] [2024-10-10 23:50:11,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818741724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:11,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:11,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:50:11,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233357998] [2024-10-10 23:50:11,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:11,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:11,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:11,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:11,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:11,967 INFO L87 Difference]: Start difference. First operand 110496 states and 121672 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:50:14,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:14,069 INFO L93 Difference]: Finished difference Result 231198 states and 254761 transitions. [2024-10-10 23:50:14,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:14,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 492 [2024-10-10 23:50:14,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:14,240 INFO L225 Difference]: With dead ends: 231198 [2024-10-10 23:50:14,240 INFO L226 Difference]: Without dead ends: 120703 [2024-10-10 23:50:14,319 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:50:14,320 INFO L432 NwaCegarLoop]: 655 mSDtfsCounter, 496 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:14,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 701 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:50:14,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120703 states. [2024-10-10 23:50:15,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120703 to 120274. [2024-10-10 23:50:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120274 states, 120273 states have (on average 1.095881868748597) internal successors, (131805), 120273 states have internal predecessors, (131805), 0 states have call successors, (0), 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:50:16,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120274 states to 120274 states and 131805 transitions. [2024-10-10 23:50:16,444 INFO L78 Accepts]: Start accepts. Automaton has 120274 states and 131805 transitions. Word has length 492 [2024-10-10 23:50:16,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:16,445 INFO L471 AbstractCegarLoop]: Abstraction has 120274 states and 131805 transitions. [2024-10-10 23:50:16,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:50:16,445 INFO L276 IsEmpty]: Start isEmpty. Operand 120274 states and 131805 transitions. [2024-10-10 23:50:16,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2024-10-10 23:50:16,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:16,453 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:50:16,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:50:16,453 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:16,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:16,453 INFO L85 PathProgramCache]: Analyzing trace with hash -235892886, now seen corresponding path program 1 times [2024-10-10 23:50:16,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:16,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443166069] [2024-10-10 23:50:16,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:16,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:16,825 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 647 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-10 23:50:16,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:16,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443166069] [2024-10-10 23:50:16,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443166069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:16,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:16,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:50:16,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759484186] [2024-10-10 23:50:16,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:16,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:16,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:16,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:16,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:16,829 INFO L87 Difference]: Start difference. First operand 120274 states and 131805 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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:50:18,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:18,873 INFO L93 Difference]: Finished difference Result 252466 states and 276672 transitions. [2024-10-10 23:50:18,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:18,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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 498 [2024-10-10 23:50:18,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:19,024 INFO L225 Difference]: With dead ends: 252466 [2024-10-10 23:50:19,024 INFO L226 Difference]: Without dead ends: 131763 [2024-10-10 23:50:19,086 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:50:19,087 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 325 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:19,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 290 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:50:19,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131763 states. [2024-10-10 23:50:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131763 to 126219. [2024-10-10 23:50:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126219 states, 126218 states have (on average 1.0837439984788224) internal successors, (136788), 126218 states have internal predecessors, (136788), 0 states have call successors, (0), 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:50:21,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126219 states to 126219 states and 136788 transitions. [2024-10-10 23:50:21,455 INFO L78 Accepts]: Start accepts. Automaton has 126219 states and 136788 transitions. Word has length 498 [2024-10-10 23:50:21,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:21,456 INFO L471 AbstractCegarLoop]: Abstraction has 126219 states and 136788 transitions. [2024-10-10 23:50:21,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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:50:21,456 INFO L276 IsEmpty]: Start isEmpty. Operand 126219 states and 136788 transitions. [2024-10-10 23:50:21,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2024-10-10 23:50:21,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:21,462 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:21,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:50:21,462 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:21,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:21,463 INFO L85 PathProgramCache]: Analyzing trace with hash 213473206, now seen corresponding path program 1 times [2024-10-10 23:50:21,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:21,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965101127] [2024-10-10 23:50:21,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:21,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms