./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_label46.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_label46.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 41cafc53a40b6e7779bbda9324b8e7811f318944543219bcda44525ed08008a3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:48:48,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:48:49,070 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:48:49,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:48:49,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:48:49,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:48:49,103 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:48:49,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:48:49,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:48:49,105 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:48:49,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:48:49,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:48:49,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:48:49,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:48:49,107 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:48:49,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:48:49,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:48:49,108 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:48:49,109 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:48:49,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:48:49,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:48:49,113 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:48:49,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:48:49,114 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:48:49,114 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:48:49,115 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:48:49,115 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:48:49,115 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:48:49,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:48:49,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:48:49,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:48:49,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:48:49,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:48:49,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:48:49,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:48:49,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:48:49,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:48:49,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:48:49,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:48:49,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:48:49,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:48:49,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:48:49,120 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 -> 41cafc53a40b6e7779bbda9324b8e7811f318944543219bcda44525ed08008a3 [2024-10-10 23:48:49,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:48:49,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:48:49,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:48:49,469 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:48:49,470 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:48:49,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label46.c [2024-10-10 23:48:50,931 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:48:51,324 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:48:51,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label46.c [2024-10-10 23:48:51,357 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c5b0881d4/c90bc13770594558ae97f2e678a31772/FLAGd7ef9fe47 [2024-10-10 23:48:51,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c5b0881d4/c90bc13770594558ae97f2e678a31772 [2024-10-10 23:48:51,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:48:51,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:48:51,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:48:51,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:48:51,387 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:48:51,388 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:48:51" (1/1) ... [2024-10-10 23:48:51,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34551c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:51, skipping insertion in model container [2024-10-10 23:48:51,389 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:48:51" (1/1) ... [2024-10-10 23:48:51,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:48:51,720 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_label46.c[1649,1662] [2024-10-10 23:48:52,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:48:52,268 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:48:52,282 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_label46.c[1649,1662] [2024-10-10 23:48:52,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:48:52,575 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:48:52,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:52 WrapperNode [2024-10-10 23:48:52,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:48:52,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:48:52,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:48:52,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:48:52,585 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:48:52" (1/1) ... [2024-10-10 23:48:52,637 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:48:52" (1/1) ... [2024-10-10 23:48:52,887 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-10 23:48:52,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:48:52,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:48:52,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:48:52,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:48:52,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:52" (1/1) ... [2024-10-10 23:48:52,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:52" (1/1) ... [2024-10-10 23:48:53,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:52" (1/1) ... [2024-10-10 23:48:53,190 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:48:53,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:52" (1/1) ... [2024-10-10 23:48:53,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:52" (1/1) ... [2024-10-10 23:48:53,339 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:52" (1/1) ... [2024-10-10 23:48:53,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:52" (1/1) ... [2024-10-10 23:48:53,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:52" (1/1) ... [2024-10-10 23:48:53,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:52" (1/1) ... [2024-10-10 23:48:53,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:48:53,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:48:53,453 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:48:53,453 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:48:53,454 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:52" (1/1) ... [2024-10-10 23:48:53,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:48:53,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:48:53,492 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:48:53,495 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:48:53,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:48:53,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:48:53,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:48:53,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:48:53,621 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:48:53,624 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:48:57,045 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-10 23:48:57,045 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:48:57,110 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:48:57,111 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:48:57,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:48:57 BoogieIcfgContainer [2024-10-10 23:48:57,111 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:48:57,114 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:48:57,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:48:57,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:48:57,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:48:51" (1/3) ... [2024-10-10 23:48:57,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7266e034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:48:57, skipping insertion in model container [2024-10-10 23:48:57,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:52" (2/3) ... [2024-10-10 23:48:57,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7266e034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:48:57, skipping insertion in model container [2024-10-10 23:48:57,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:48:57" (3/3) ... [2024-10-10 23:48:57,125 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label46.c [2024-10-10 23:48:57,144 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:48:57,144 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:48:57,241 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:48:57,250 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;@4d4c3693, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:48:57,250 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:48:57,257 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:48:57,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-10 23:48:57,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:57,266 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:57,267 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:57,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:57,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1378608494, now seen corresponding path program 1 times [2024-10-10 23:48:57,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:57,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351995266] [2024-10-10 23:48:57,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:57,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:57,467 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:48:57,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:57,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351995266] [2024-10-10 23:48:57,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351995266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:57,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:57,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:48:57,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720689290] [2024-10-10 23:48:57,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:57,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:48:57,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:57,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:48:57,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:48:57,513 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 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:48:57,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:57,608 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-10 23:48:57,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:48:57,615 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-10-10 23:48:57,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:57,635 INFO L225 Difference]: With dead ends: 1055 [2024-10-10 23:48:57,635 INFO L226 Difference]: Without dead ends: 526 [2024-10-10 23:48:57,640 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:48:57,647 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:48:57,650 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:48:57,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-10 23:48:57,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-10 23:48:57,716 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:48:57,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-10 23:48:57,721 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 9 [2024-10-10 23:48:57,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:57,722 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-10 23:48:57,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 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:48:57,722 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-10 23:48:57,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-10 23:48:57,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:57,723 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:57,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:48:57,724 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:57,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:57,724 INFO L85 PathProgramCache]: Analyzing trace with hash 462795106, now seen corresponding path program 1 times [2024-10-10 23:48:57,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:57,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556908081] [2024-10-10 23:48:57,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:57,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:57,836 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:48:57,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:57,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556908081] [2024-10-10 23:48:57,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556908081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:57,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:57,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:48:57,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448113461] [2024-10-10 23:48:57,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:57,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:57,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:57,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:57,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:57,840 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 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:00,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:00,188 INFO L93 Difference]: Finished difference Result 1499 states and 2693 transitions. [2024-10-10 23:49:00,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:00,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-10-10 23:49:00,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:00,197 INFO L225 Difference]: With dead ends: 1499 [2024-10-10 23:49:00,198 INFO L226 Difference]: Without dead ends: 974 [2024-10-10 23:49:00,199 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:00,203 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 464 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:00,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 495 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:49:00,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-10-10 23:49:00,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 971. [2024-10-10 23:49:00,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5082474226804123) internal successors, (1463), 970 states have internal predecessors, (1463), 0 states have call successors, (0), 0 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:00,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1463 transitions. [2024-10-10 23:49:00,256 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1463 transitions. Word has length 9 [2024-10-10 23:49:00,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:00,256 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1463 transitions. [2024-10-10 23:49:00,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 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:00,257 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1463 transitions. [2024-10-10 23:49:00,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-10 23:49:00,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:00,259 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:00,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:49:00,260 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:00,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:00,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2144504430, now seen corresponding path program 1 times [2024-10-10 23:49:00,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:00,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233423126] [2024-10-10 23:49:00,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:00,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:00,551 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:49:00,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:00,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233423126] [2024-10-10 23:49:00,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233423126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:00,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:00,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:00,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631144850] [2024-10-10 23:49:00,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:00,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:00,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:00,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:00,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:00,557 INFO L87 Difference]: Start difference. First operand 971 states and 1463 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:02,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:02,980 INFO L93 Difference]: Finished difference Result 2813 states and 4241 transitions. [2024-10-10 23:49:02,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:02,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-10-10 23:49:02,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:02,988 INFO L225 Difference]: With dead ends: 2813 [2024-10-10 23:49:02,988 INFO L226 Difference]: Without dead ends: 1843 [2024-10-10 23:49:02,990 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:02,991 INFO L432 NwaCegarLoop]: 851 mSDtfsCounter, 481 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:02,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 918 Invalid, 1698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:49:02,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2024-10-10 23:49:03,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1841. [2024-10-10 23:49:03,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.3603260869565217) internal successors, (2503), 1840 states have internal predecessors, (2503), 0 states have call successors, (0), 0 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:03,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2503 transitions. [2024-10-10 23:49:03,039 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2503 transitions. Word has length 79 [2024-10-10 23:49:03,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:03,040 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2503 transitions. [2024-10-10 23:49:03,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:03,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2503 transitions. [2024-10-10 23:49:03,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-10 23:49:03,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:03,044 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:49:03,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:49:03,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:03,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:03,047 INFO L85 PathProgramCache]: Analyzing trace with hash 2101992081, now seen corresponding path program 1 times [2024-10-10 23:49:03,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:03,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864286081] [2024-10-10 23:49:03,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:03,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:03,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:49:03,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:03,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864286081] [2024-10-10 23:49:03,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864286081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:03,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:03,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:49:03,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559453794] [2024-10-10 23:49:03,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:03,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:03,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:03,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:03,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:03,302 INFO L87 Difference]: Start difference. First operand 1841 states and 2503 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 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:05,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:05,414 INFO L93 Difference]: Finished difference Result 5394 states and 7325 transitions. [2024-10-10 23:49:05,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:05,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-10-10 23:49:05,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:05,425 INFO L225 Difference]: With dead ends: 5394 [2024-10-10 23:49:05,425 INFO L226 Difference]: Without dead ends: 2700 [2024-10-10 23:49:05,429 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:05,430 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 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, 2.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:05,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 589 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-10 23:49:05,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2024-10-10 23:49:05,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2700. [2024-10-10 23:49:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2699 states have (on average 1.1919229344201556) internal successors, (3217), 2699 states have internal predecessors, (3217), 0 states have call successors, (0), 0 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:05,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 3217 transitions. [2024-10-10 23:49:05,481 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 3217 transitions. Word has length 101 [2024-10-10 23:49:05,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:05,482 INFO L471 AbstractCegarLoop]: Abstraction has 2700 states and 3217 transitions. [2024-10-10 23:49:05,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 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:05,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 3217 transitions. [2024-10-10 23:49:05,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-10 23:49:05,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:05,485 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:05,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:49:05,486 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:05,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:05,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1532868037, now seen corresponding path program 1 times [2024-10-10 23:49:05,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:05,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131901054] [2024-10-10 23:49:05,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:05,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:05,762 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:49:05,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:05,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131901054] [2024-10-10 23:49:05,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131901054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:05,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:05,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:05,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215688396] [2024-10-10 23:49:05,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:05,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:05,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:05,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:05,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:05,765 INFO L87 Difference]: Start difference. First operand 2700 states and 3217 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 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:07,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:07,230 INFO L93 Difference]: Finished difference Result 7107 states and 8597 transitions. [2024-10-10 23:49:07,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:07,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-10-10 23:49:07,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:07,245 INFO L225 Difference]: With dead ends: 7107 [2024-10-10 23:49:07,246 INFO L226 Difference]: Without dead ends: 4408 [2024-10-10 23:49:07,251 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:07,254 INFO L432 NwaCegarLoop]: 724 mSDtfsCounter, 496 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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:07,256 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:07,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4408 states. [2024-10-10 23:49:07,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4408 to 4408. [2024-10-10 23:49:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4408 states, 4407 states have (on average 1.1706376219650556) internal successors, (5159), 4407 states have internal predecessors, (5159), 0 states have call successors, (0), 0 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:07,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4408 states to 4408 states and 5159 transitions. [2024-10-10 23:49:07,330 INFO L78 Accepts]: Start accepts. Automaton has 4408 states and 5159 transitions. Word has length 161 [2024-10-10 23:49:07,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:07,330 INFO L471 AbstractCegarLoop]: Abstraction has 4408 states and 5159 transitions. [2024-10-10 23:49:07,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 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:07,331 INFO L276 IsEmpty]: Start isEmpty. Operand 4408 states and 5159 transitions. [2024-10-10 23:49:07,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-10 23:49:07,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:07,333 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:07,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:49:07,333 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:07,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:07,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1116156032, now seen corresponding path program 1 times [2024-10-10 23:49:07,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:07,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522278320] [2024-10-10 23:49:07,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:07,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:07,530 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-10 23:49:07,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:07,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522278320] [2024-10-10 23:49:07,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522278320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:07,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:07,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:07,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344331739] [2024-10-10 23:49:07,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:07,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:07,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:07,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:07,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:07,533 INFO L87 Difference]: Start difference. First operand 4408 states and 5159 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:09,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:09,241 INFO L93 Difference]: Finished difference Result 10935 states and 12969 transitions. [2024-10-10 23:49:09,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:09,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 163 [2024-10-10 23:49:09,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:09,262 INFO L225 Difference]: With dead ends: 10935 [2024-10-10 23:49:09,262 INFO L226 Difference]: Without dead ends: 6527 [2024-10-10 23:49:09,269 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:09,271 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 440 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:09,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 442 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:49:09,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6527 states. [2024-10-10 23:49:09,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6527 to 4381. [2024-10-10 23:49:09,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4381 states, 4380 states have (on average 1.1684931506849314) internal successors, (5118), 4380 states have internal predecessors, (5118), 0 states have call successors, (0), 0 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:09,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 4381 states and 5118 transitions. [2024-10-10 23:49:09,366 INFO L78 Accepts]: Start accepts. Automaton has 4381 states and 5118 transitions. Word has length 163 [2024-10-10 23:49:09,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:09,368 INFO L471 AbstractCegarLoop]: Abstraction has 4381 states and 5118 transitions. [2024-10-10 23:49:09,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:09,369 INFO L276 IsEmpty]: Start isEmpty. Operand 4381 states and 5118 transitions. [2024-10-10 23:49:09,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-10 23:49:09,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:09,372 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:49:09,373 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:09,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:09,373 INFO L85 PathProgramCache]: Analyzing trace with hash -338158650, now seen corresponding path program 1 times [2024-10-10 23:49:09,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:09,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004042909] [2024-10-10 23:49:09,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:09,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 15 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:49:09,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:09,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004042909] [2024-10-10 23:49:09,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004042909] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:49:09,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666477190] [2024-10-10 23:49:09,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:09,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:49:09,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:49:09,947 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:09,949 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:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:10,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 23:49:10,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:49:10,422 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 15 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:49:10,422 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:49:10,781 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:49:10,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666477190] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:49:10,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:49:10,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-10-10 23:49:10,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944755521] [2024-10-10 23:49:10,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:10,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:49:10,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:10,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:49:10,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:49:10,784 INFO L87 Difference]: Start difference. First operand 4381 states and 5118 transitions. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 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:13,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:13,896 INFO L93 Difference]: Finished difference Result 16038 states and 18797 transitions. [2024-10-10 23:49:13,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:49:13,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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 229 [2024-10-10 23:49:13,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:13,932 INFO L225 Difference]: With dead ends: 16038 [2024-10-10 23:49:13,933 INFO L226 Difference]: Without dead ends: 10803 [2024-10-10 23:49:13,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 455 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:13,942 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 767 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2598 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 2598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:13,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 151 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 2598 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-10 23:49:13,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10803 states. [2024-10-10 23:49:14,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10803 to 9923. [2024-10-10 23:49:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9923 states, 9922 states have (on average 1.1543035678290667) internal successors, (11453), 9922 states have internal predecessors, (11453), 0 states have call successors, (0), 0 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:14,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9923 states to 9923 states and 11453 transitions. [2024-10-10 23:49:14,136 INFO L78 Accepts]: Start accepts. Automaton has 9923 states and 11453 transitions. Word has length 229 [2024-10-10 23:49:14,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:14,136 INFO L471 AbstractCegarLoop]: Abstraction has 9923 states and 11453 transitions. [2024-10-10 23:49:14,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 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:14,137 INFO L276 IsEmpty]: Start isEmpty. Operand 9923 states and 11453 transitions. [2024-10-10 23:49:14,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-10-10 23:49:14,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:14,141 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:14,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 23:49:14,345 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:14,346 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:14,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:14,347 INFO L85 PathProgramCache]: Analyzing trace with hash 126278507, now seen corresponding path program 1 times [2024-10-10 23:49:14,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:14,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788870810] [2024-10-10 23:49:14,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:14,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-10 23:49:14,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:14,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788870810] [2024-10-10 23:49:14,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788870810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:14,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:14,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:14,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829710654] [2024-10-10 23:49:14,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:14,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:14,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:14,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:14,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:14,615 INFO L87 Difference]: Start difference. First operand 9923 states and 11453 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 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:16,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:16,275 INFO L93 Difference]: Finished difference Result 24945 states and 29141 transitions. [2024-10-10 23:49:16,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:16,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 258 [2024-10-10 23:49:16,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:16,314 INFO L225 Difference]: With dead ends: 24945 [2024-10-10 23:49:16,314 INFO L226 Difference]: Without dead ends: 14173 [2024-10-10 23:49:16,328 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:16,329 INFO L432 NwaCegarLoop]: 761 mSDtfsCounter, 367 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:16,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 827 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:49:16,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14173 states. [2024-10-10 23:49:16,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14173 to 14173. [2024-10-10 23:49:16,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14173 states, 14172 states have (on average 1.1241885407846457) internal successors, (15932), 14172 states have internal predecessors, (15932), 0 states have call successors, (0), 0 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:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14173 states to 14173 states and 15932 transitions. [2024-10-10 23:49:16,599 INFO L78 Accepts]: Start accepts. Automaton has 14173 states and 15932 transitions. Word has length 258 [2024-10-10 23:49:16,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:16,603 INFO L471 AbstractCegarLoop]: Abstraction has 14173 states and 15932 transitions. [2024-10-10 23:49:16,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 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:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand 14173 states and 15932 transitions. [2024-10-10 23:49:16,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-10-10 23:49:16,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:16,613 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 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:16,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:49:16,616 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:16,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:16,617 INFO L85 PathProgramCache]: Analyzing trace with hash -310433434, now seen corresponding path program 1 times [2024-10-10 23:49:16,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:16,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794953646] [2024-10-10 23:49:16,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:16,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:16,855 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-10-10 23:49:16,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:16,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794953646] [2024-10-10 23:49:16,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794953646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:16,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:16,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:16,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230634123] [2024-10-10 23:49:16,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:16,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:16,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:16,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:16,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:16,860 INFO L87 Difference]: Start difference. First operand 14173 states and 15932 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 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,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:18,753 INFO L93 Difference]: Finished difference Result 33879 states and 38361 transitions. [2024-10-10 23:49:18,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:18,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 281 [2024-10-10 23:49:18,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:18,787 INFO L225 Difference]: With dead ends: 33879 [2024-10-10 23:49:18,787 INFO L226 Difference]: Without dead ends: 17978 [2024-10-10 23:49:18,803 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:18,804 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 529 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:18,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 648 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:49:18,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17978 states. [2024-10-10 23:49:18,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17978 to 17122. [2024-10-10 23:49:19,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17122 states, 17121 states have (on average 1.1258688160738275) internal successors, (19276), 17121 states have internal predecessors, (19276), 0 states have call successors, (0), 0 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:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17122 states to 17122 states and 19276 transitions. [2024-10-10 23:49:19,052 INFO L78 Accepts]: Start accepts. Automaton has 17122 states and 19276 transitions. Word has length 281 [2024-10-10 23:49:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:19,052 INFO L471 AbstractCegarLoop]: Abstraction has 17122 states and 19276 transitions. [2024-10-10 23:49:19,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:19,053 INFO L276 IsEmpty]: Start isEmpty. Operand 17122 states and 19276 transitions. [2024-10-10 23:49:19,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2024-10-10 23:49:19,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:19,058 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:19,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:49:19,058 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:19,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:19,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1345695420, now seen corresponding path program 1 times [2024-10-10 23:49:19,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:19,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506567801] [2024-10-10 23:49:19,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:19,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:19,402 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-10 23:49:19,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:19,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506567801] [2024-10-10 23:49:19,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506567801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:19,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:19,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:19,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750802447] [2024-10-10 23:49:19,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:19,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:19,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:19,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:19,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:19,405 INFO L87 Difference]: Start difference. First operand 17122 states and 19276 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 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:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:21,158 INFO L93 Difference]: Finished difference Result 42769 states and 48178 transitions. [2024-10-10 23:49:21,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:21,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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 303 [2024-10-10 23:49:21,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:21,209 INFO L225 Difference]: With dead ends: 42769 [2024-10-10 23:49:21,209 INFO L226 Difference]: Without dead ends: 25648 [2024-10-10 23:49:21,234 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:21,235 INFO L432 NwaCegarLoop]: 727 mSDtfsCounter, 316 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:21,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 775 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:49:21,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25648 states. [2024-10-10 23:49:21,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25648 to 24361. [2024-10-10 23:49:21,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24361 states, 24360 states have (on average 1.110919540229885) internal successors, (27062), 24360 states have internal predecessors, (27062), 0 states have call successors, (0), 0 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:21,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24361 states to 24361 states and 27062 transitions. [2024-10-10 23:49:21,539 INFO L78 Accepts]: Start accepts. Automaton has 24361 states and 27062 transitions. Word has length 303 [2024-10-10 23:49:21,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:21,539 INFO L471 AbstractCegarLoop]: Abstraction has 24361 states and 27062 transitions. [2024-10-10 23:49:21,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 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:21,540 INFO L276 IsEmpty]: Start isEmpty. Operand 24361 states and 27062 transitions. [2024-10-10 23:49:21,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-10-10 23:49:21,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:21,547 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:21,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:49:21,547 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:21,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:21,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2040895972, now seen corresponding path program 1 times [2024-10-10 23:49:21,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:21,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352213949] [2024-10-10 23:49:21,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:21,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:22,023 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:49:22,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:22,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352213949] [2024-10-10 23:49:22,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352213949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:22,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:22,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:22,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697754972] [2024-10-10 23:49:22,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:22,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:22,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:22,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:22,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:22,027 INFO L87 Difference]: Start difference. First operand 24361 states and 27062 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:49:23,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:23,608 INFO L93 Difference]: Finished difference Result 56822 states and 63399 transitions. [2024-10-10 23:49:23,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:23,609 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 334 [2024-10-10 23:49:23,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:23,657 INFO L225 Difference]: With dead ends: 56822 [2024-10-10 23:49:23,657 INFO L226 Difference]: Without dead ends: 32462 [2024-10-10 23:49:23,684 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:23,686 INFO L432 NwaCegarLoop]: 576 mSDtfsCounter, 382 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:23,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 612 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:49:23,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32462 states. [2024-10-10 23:49:24,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32462 to 32028. [2024-10-10 23:49:24,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32028 states, 32027 states have (on average 1.1097511474693227) internal successors, (35542), 32027 states have internal predecessors, (35542), 0 states have call successors, (0), 0 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:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32028 states to 32028 states and 35542 transitions. [2024-10-10 23:49:24,160 INFO L78 Accepts]: Start accepts. Automaton has 32028 states and 35542 transitions. Word has length 334 [2024-10-10 23:49:24,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:24,160 INFO L471 AbstractCegarLoop]: Abstraction has 32028 states and 35542 transitions. [2024-10-10 23:49:24,161 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:49:24,161 INFO L276 IsEmpty]: Start isEmpty. Operand 32028 states and 35542 transitions. [2024-10-10 23:49:24,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-10-10 23:49:24,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:24,172 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:24,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:49:24,173 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:24,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:24,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1276064537, now seen corresponding path program 1 times [2024-10-10 23:49:24,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:24,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696789644] [2024-10-10 23:49:24,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:24,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:24,605 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 205 proven. 82 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 23:49:24,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:24,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696789644] [2024-10-10 23:49:24,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696789644] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:49:24,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010336496] [2024-10-10 23:49:24,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:24,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:49:24,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:49:24,608 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:24,609 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:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:24,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 23:49:24,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:49:24,964 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 205 proven. 82 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 23:49:24,964 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:49:25,341 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 23:49:25,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010336496] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:49:25,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:49:25,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-10-10 23:49:25,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719292888] [2024-10-10 23:49:25,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:25,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:49:25,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:25,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:49:25,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:49:25,343 INFO L87 Difference]: Start difference. First operand 32028 states and 35542 transitions. Second operand has 4 states, 4 states have (on average 82.5) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 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,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:27,684 INFO L93 Difference]: Finished difference Result 79366 states and 88092 transitions. [2024-10-10 23:49:27,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:49:27,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 337 [2024-10-10 23:49:27,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:27,745 INFO L225 Difference]: With dead ends: 79366 [2024-10-10 23:49:27,745 INFO L226 Difference]: Without dead ends: 46914 [2024-10-10 23:49:27,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 671 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:27,777 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 784 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2184 mSolverCounterSat, 463 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 2647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 463 IncrementalHoareTripleChecker+Valid, 2184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:27,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 118 Invalid, 2647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [463 Valid, 2184 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:49:27,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46914 states. [2024-10-10 23:49:28,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46914 to 45632. [2024-10-10 23:49:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45632 states, 45631 states have (on average 1.0990992965308672) internal successors, (50153), 45631 states have internal predecessors, (50153), 0 states have call successors, (0), 0 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,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45632 states to 45632 states and 50153 transitions. [2024-10-10 23:49:28,400 INFO L78 Accepts]: Start accepts. Automaton has 45632 states and 50153 transitions. Word has length 337 [2024-10-10 23:49:28,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:28,400 INFO L471 AbstractCegarLoop]: Abstraction has 45632 states and 50153 transitions. [2024-10-10 23:49:28,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 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,401 INFO L276 IsEmpty]: Start isEmpty. Operand 45632 states and 50153 transitions. [2024-10-10 23:49:28,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-10-10 23:49:28,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:28,407 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-10-10 23:49:28,425 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:28,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:49:28,608 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:28,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:28,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1782263384, now seen corresponding path program 1 times [2024-10-10 23:49:28,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:28,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931076751] [2024-10-10 23:49:28,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:28,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:49:29,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:29,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931076751] [2024-10-10 23:49:29,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931076751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:29,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:29,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:29,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833349122] [2024-10-10 23:49:29,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:29,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:49:29,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:29,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:49:29,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:49:29,088 INFO L87 Difference]: Start difference. First operand 45632 states and 50153 transitions. Second operand has 4 states, 4 states have (on average 87.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 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:31,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:31,768 INFO L93 Difference]: Finished difference Result 102780 states and 112857 transitions. [2024-10-10 23:49:31,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:49:31,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 348 [2024-10-10 23:49:31,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:31,839 INFO L225 Difference]: With dead ends: 102780 [2024-10-10 23:49:31,840 INFO L226 Difference]: Without dead ends: 56724 [2024-10-10 23:49:31,861 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:31,861 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 547 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 2636 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 2750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:31,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 367 Invalid, 2750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 2636 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:49:31,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56724 states. [2024-10-10 23:49:32,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56724 to 55851. [2024-10-10 23:49:32,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55851 states, 55850 states have (on average 1.0956848701880035) internal successors, (61194), 55850 states have internal predecessors, (61194), 0 states have call successors, (0), 0 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,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55851 states to 55851 states and 61194 transitions. [2024-10-10 23:49:32,653 INFO L78 Accepts]: Start accepts. Automaton has 55851 states and 61194 transitions. Word has length 348 [2024-10-10 23:49:32,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:32,654 INFO L471 AbstractCegarLoop]: Abstraction has 55851 states and 61194 transitions. [2024-10-10 23:49:32,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 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,654 INFO L276 IsEmpty]: Start isEmpty. Operand 55851 states and 61194 transitions. [2024-10-10 23:49:32,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-10-10 23:49:32,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:32,658 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:32,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:49:32,659 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:32,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:32,660 INFO L85 PathProgramCache]: Analyzing trace with hash -708207262, now seen corresponding path program 1 times [2024-10-10 23:49:32,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:32,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303236702] [2024-10-10 23:49:32,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:32,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:33,162 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:49:33,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:33,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303236702] [2024-10-10 23:49:33,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303236702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:33,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:33,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:33,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372305331] [2024-10-10 23:49:33,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:33,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:33,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:33,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:33,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:33,167 INFO L87 Difference]: Start difference. First operand 55851 states and 61194 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 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:35,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:35,038 INFO L93 Difference]: Finished difference Result 122802 states and 134890 transitions. [2024-10-10 23:49:35,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:35,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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:35,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:35,119 INFO L225 Difference]: With dead ends: 122802 [2024-10-10 23:49:35,120 INFO L226 Difference]: Without dead ends: 67377 [2024-10-10 23:49:35,142 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:35,142 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 339 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:35,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 617 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:49:35,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67377 states. [2024-10-10 23:49:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67377 to 66080. [2024-10-10 23:49:35,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66080 states, 66079 states have (on average 1.099063242482483) internal successors, (72625), 66079 states have internal predecessors, (72625), 0 states have call successors, (0), 0 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:35,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66080 states to 66080 states and 72625 transitions. [2024-10-10 23:49:35,906 INFO L78 Accepts]: Start accepts. Automaton has 66080 states and 72625 transitions. Word has length 352 [2024-10-10 23:49:35,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:35,908 INFO L471 AbstractCegarLoop]: Abstraction has 66080 states and 72625 transitions. [2024-10-10 23:49:35,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 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:35,908 INFO L276 IsEmpty]: Start isEmpty. Operand 66080 states and 72625 transitions. [2024-10-10 23:49:35,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2024-10-10 23:49:35,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:35,918 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:35,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:49:35,918 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:35,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:35,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1159135552, now seen corresponding path program 1 times [2024-10-10 23:49:35,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:35,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022815113] [2024-10-10 23:49:35,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:35,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:36,684 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:49:36,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:36,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022815113] [2024-10-10 23:49:36,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022815113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:36,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:36,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:36,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608250717] [2024-10-10 23:49:36,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:36,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:36,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:36,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:36,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:36,687 INFO L87 Difference]: Start difference. First operand 66080 states and 72625 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 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:38,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:38,371 INFO L93 Difference]: Finished difference Result 146623 states and 161307 transitions. [2024-10-10 23:49:38,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:38,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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 423 [2024-10-10 23:49:38,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:38,466 INFO L225 Difference]: With dead ends: 146623 [2024-10-10 23:49:38,467 INFO L226 Difference]: Without dead ends: 80969 [2024-10-10 23:49:38,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:38,644 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 304 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:38,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 318 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:49:38,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80969 states. [2024-10-10 23:49:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80969 to 76286. [2024-10-10 23:49:39,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76286 states, 76285 states have (on average 1.093229337353346) internal successors, (83397), 76285 states have internal predecessors, (83397), 0 states have call successors, (0), 0 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,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76286 states to 76286 states and 83397 transitions. [2024-10-10 23:49:39,630 INFO L78 Accepts]: Start accepts. Automaton has 76286 states and 83397 transitions. Word has length 423 [2024-10-10 23:49:39,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:39,631 INFO L471 AbstractCegarLoop]: Abstraction has 76286 states and 83397 transitions. [2024-10-10 23:49:39,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 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,631 INFO L276 IsEmpty]: Start isEmpty. Operand 76286 states and 83397 transitions. [2024-10-10 23:49:39,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2024-10-10 23:49:39,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:39,648 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:39,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:49:39,648 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:39,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:39,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1350454831, now seen corresponding path program 1 times [2024-10-10 23:49:39,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:39,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539709081] [2024-10-10 23:49:39,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:39,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:40,387 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-10 23:49:40,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:40,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539709081] [2024-10-10 23:49:40,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539709081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:40,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:40,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:40,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112350236] [2024-10-10 23:49:40,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:40,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:40,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:40,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:40,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:40,391 INFO L87 Difference]: Start difference. First operand 76286 states and 83397 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:49:42,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:42,229 INFO L93 Difference]: Finished difference Result 165774 states and 181663 transitions. [2024-10-10 23:49:42,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:42,230 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 472 [2024-10-10 23:49:42,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:42,341 INFO L225 Difference]: With dead ends: 165774 [2024-10-10 23:49:42,341 INFO L226 Difference]: Without dead ends: 89914 [2024-10-10 23:49:42,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:42,389 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 315 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:42,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 320 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:49:42,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89914 states. [2024-10-10 23:49:43,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89914 to 79686. [2024-10-10 23:49:43,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79686 states, 79685 states have (on average 1.0893769216289138) internal successors, (86807), 79685 states have internal predecessors, (86807), 0 states have call successors, (0), 0 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,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79686 states to 79686 states and 86807 transitions. [2024-10-10 23:49:43,604 INFO L78 Accepts]: Start accepts. Automaton has 79686 states and 86807 transitions. Word has length 472 [2024-10-10 23:49:43,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:43,605 INFO L471 AbstractCegarLoop]: Abstraction has 79686 states and 86807 transitions. [2024-10-10 23:49:43,605 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:49:43,605 INFO L276 IsEmpty]: Start isEmpty. Operand 79686 states and 86807 transitions. [2024-10-10 23:49:43,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2024-10-10 23:49:43,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:43,623 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:43,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:49:43,624 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:43,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:43,624 INFO L85 PathProgramCache]: Analyzing trace with hash 899989099, now seen corresponding path program 1 times [2024-10-10 23:49:43,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:43,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382116664] [2024-10-10 23:49:43,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:43,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:44,391 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2024-10-10 23:49:44,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:44,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382116664] [2024-10-10 23:49:44,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382116664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:44,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:44,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:49:44,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476648060] [2024-10-10 23:49:44,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:44,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:44,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:44,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:44,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:44,394 INFO L87 Difference]: Start difference. First operand 79686 states and 86807 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 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:45,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:45,344 INFO L93 Difference]: Finished difference Result 154677 states and 168501 transitions. [2024-10-10 23:49:45,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:45,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 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 483 [2024-10-10 23:49:45,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:45,434 INFO L225 Difference]: With dead ends: 154677 [2024-10-10 23:49:45,434 INFO L226 Difference]: Without dead ends: 75416 [2024-10-10 23:49:45,482 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:45,482 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 567 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:45,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 78 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:49:45,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75416 states. [2024-10-10 23:49:46,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75416 to 75407. [2024-10-10 23:49:46,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75407 states, 75406 states have (on average 1.0884810227302868) internal successors, (82078), 75406 states have internal predecessors, (82078), 0 states have call successors, (0), 0 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,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75407 states to 75407 states and 82078 transitions. [2024-10-10 23:49:46,732 INFO L78 Accepts]: Start accepts. Automaton has 75407 states and 82078 transitions. Word has length 483 [2024-10-10 23:49:46,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:46,733 INFO L471 AbstractCegarLoop]: Abstraction has 75407 states and 82078 transitions. [2024-10-10 23:49:46,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 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,733 INFO L276 IsEmpty]: Start isEmpty. Operand 75407 states and 82078 transitions. [2024-10-10 23:49:46,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2024-10-10 23:49:46,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:46,743 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:49:46,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:49:46,743 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:46,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:46,744 INFO L85 PathProgramCache]: Analyzing trace with hash -293342258, now seen corresponding path program 1 times [2024-10-10 23:49:46,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:46,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578267945] [2024-10-10 23:49:46,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:46,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:47,116 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-10 23:49:47,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:47,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578267945] [2024-10-10 23:49:47,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578267945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:47,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:47,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:49:47,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192759958] [2024-10-10 23:49:47,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:47,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:49:47,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:47,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:49:47,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:49:47,119 INFO L87 Difference]: Start difference. First operand 75407 states and 82078 transitions. Second operand has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 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:49,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:49,687 INFO L93 Difference]: Finished difference Result 159758 states and 173891 transitions. [2024-10-10 23:49:49,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:49:49,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 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 495 [2024-10-10 23:49:49,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:49,797 INFO L225 Difference]: With dead ends: 159758 [2024-10-10 23:49:49,797 INFO L226 Difference]: Without dead ends: 84777 [2024-10-10 23:49:49,851 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:49,852 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 784 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 2160 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 2437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 2160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:49,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 217 Invalid, 2437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 2160 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:49:49,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84777 states. [2024-10-10 23:49:50,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84777 to 78803. [2024-10-10 23:49:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78803 states, 78802 states have (on average 1.078449785538438) internal successors, (84984), 78802 states have internal predecessors, (84984), 0 states have call successors, (0), 0 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,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78803 states to 78803 states and 84984 transitions. [2024-10-10 23:49:51,361 INFO L78 Accepts]: Start accepts. Automaton has 78803 states and 84984 transitions. Word has length 495 [2024-10-10 23:49:51,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:51,361 INFO L471 AbstractCegarLoop]: Abstraction has 78803 states and 84984 transitions. [2024-10-10 23:49:51,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 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,362 INFO L276 IsEmpty]: Start isEmpty. Operand 78803 states and 84984 transitions. [2024-10-10 23:49:51,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2024-10-10 23:49:51,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:51,379 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:51,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:49:51,379 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:51,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:51,380 INFO L85 PathProgramCache]: Analyzing trace with hash 958857227, now seen corresponding path program 1 times [2024-10-10 23:49:51,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:51,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532040007] [2024-10-10 23:49:51,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:51,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-10 23:49:51,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:51,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532040007] [2024-10-10 23:49:51,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532040007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:51,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:51,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:49:51,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212309267] [2024-10-10 23:49:51,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:51,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:49:51,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:51,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:49:51,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:49:51,788 INFO L87 Difference]: Start difference. First operand 78803 states and 84984 transitions. Second operand has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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:54,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:54,365 INFO L93 Difference]: Finished difference Result 168693 states and 181660 transitions. [2024-10-10 23:49:54,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:49:54,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 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 501 [2024-10-10 23:49:54,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:54,475 INFO L225 Difference]: With dead ends: 168693 [2024-10-10 23:49:54,475 INFO L226 Difference]: Without dead ends: 90741 [2024-10-10 23:49:54,522 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:54,522 INFO L432 NwaCegarLoop]: 608 mSDtfsCounter, 786 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2765 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 2935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 2765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:54,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 690 Invalid, 2935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 2765 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-10 23:49:54,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90741 states. [2024-10-10 23:49:55,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90741 to 80493. [2024-10-10 23:49:55,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80493 states, 80492 states have (on average 1.070118769567162) internal successors, (86136), 80492 states have internal predecessors, (86136), 0 states have call successors, (0), 0 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:55,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80493 states to 80493 states and 86136 transitions. [2024-10-10 23:49:55,730 INFO L78 Accepts]: Start accepts. Automaton has 80493 states and 86136 transitions. Word has length 501 [2024-10-10 23:49:55,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:55,731 INFO L471 AbstractCegarLoop]: Abstraction has 80493 states and 86136 transitions. [2024-10-10 23:49:55,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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:55,731 INFO L276 IsEmpty]: Start isEmpty. Operand 80493 states and 86136 transitions. [2024-10-10 23:49:55,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2024-10-10 23:49:55,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:55,761 INFO L215 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:55,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:49:55,761 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:55,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:55,762 INFO L85 PathProgramCache]: Analyzing trace with hash -233757817, now seen corresponding path program 1 times [2024-10-10 23:49:55,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:55,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125130356] [2024-10-10 23:49:55,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:55,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:56,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 733 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2024-10-10 23:49:56,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:56,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125130356] [2024-10-10 23:49:56,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125130356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:56,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:56,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:56,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284811509] [2024-10-10 23:49:56,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:56,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:56,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:56,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:56,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:56,150 INFO L87 Difference]: Start difference. First operand 80493 states and 86136 transitions. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 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:58,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:58,208 INFO L93 Difference]: Finished difference Result 163107 states and 174635 transitions. [2024-10-10 23:49:58,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:58,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 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 593 [2024-10-10 23:49:58,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:58,297 INFO L225 Difference]: With dead ends: 163107 [2024-10-10 23:49:58,297 INFO L226 Difference]: Without dead ends: 83465 [2024-10-10 23:49:58,341 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:58,342 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 382 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:58,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 179 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:49:58,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83465 states. [2024-10-10 23:49:59,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83465 to 73676. [2024-10-10 23:49:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73676 states, 73675 states have (on average 1.0681642348150662) internal successors, (78697), 73675 states have internal predecessors, (78697), 0 states have call successors, (0), 0 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:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73676 states to 73676 states and 78697 transitions. [2024-10-10 23:49:59,415 INFO L78 Accepts]: Start accepts. Automaton has 73676 states and 78697 transitions. Word has length 593 [2024-10-10 23:49:59,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:59,415 INFO L471 AbstractCegarLoop]: Abstraction has 73676 states and 78697 transitions. [2024-10-10 23:49:59,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 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:59,416 INFO L276 IsEmpty]: Start isEmpty. Operand 73676 states and 78697 transitions. [2024-10-10 23:49:59,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2024-10-10 23:49:59,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:59,431 INFO L215 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:59,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:49:59,432 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:59,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:59,432 INFO L85 PathProgramCache]: Analyzing trace with hash -393175409, now seen corresponding path program 1 times [2024-10-10 23:49:59,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:59,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555812638] [2024-10-10 23:49:59,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:59,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 489 proven. 0 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2024-10-10 23:50:00,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:00,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555812638] [2024-10-10 23:50:00,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555812638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:00,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:00,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:50:00,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463019277] [2024-10-10 23:50:00,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:00,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:00,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:00,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:00,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:00,036 INFO L87 Difference]: Start difference. First operand 73676 states and 78697 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:50:01,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:01,578 INFO L93 Difference]: Finished difference Result 152467 states and 162685 transitions. [2024-10-10 23:50:01,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:01,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 621 [2024-10-10 23:50:01,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:01,686 INFO L225 Difference]: With dead ends: 152467 [2024-10-10 23:50:01,687 INFO L226 Difference]: Without dead ends: 79642 [2024-10-10 23:50:01,737 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:01,738 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 335 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:01,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 86 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:50:01,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79642 states. [2024-10-10 23:50:02,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79642 to 65159. [2024-10-10 23:50:02,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65159 states, 65158 states have (on average 1.0640443230301728) internal successors, (69331), 65158 states have internal predecessors, (69331), 0 states have call successors, (0), 0 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,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65159 states to 65159 states and 69331 transitions. [2024-10-10 23:50:02,935 INFO L78 Accepts]: Start accepts. Automaton has 65159 states and 69331 transitions. Word has length 621 [2024-10-10 23:50:02,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:02,936 INFO L471 AbstractCegarLoop]: Abstraction has 65159 states and 69331 transitions. [2024-10-10 23:50:02,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:50:02,936 INFO L276 IsEmpty]: Start isEmpty. Operand 65159 states and 69331 transitions. [2024-10-10 23:50:02,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2024-10-10 23:50:02,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:02,971 INFO L215 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 23:50:02,971 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:02,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:02,972 INFO L85 PathProgramCache]: Analyzing trace with hash -934808561, now seen corresponding path program 1 times [2024-10-10 23:50:02,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:02,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355898708] [2024-10-10 23:50:02,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:02,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat