./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_label05.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_label05.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 9ab20fd2c170582703dc94cfdcd8e10a79137aac9ab76b1936884b512261ae10 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:44:38,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:44:38,581 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:44:38,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:44:38,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:44:38,617 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:44:38,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:44:38,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:44:38,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:44:38,620 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:44:38,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:44:38,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:44:38,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:44:38,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:44:38,622 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:44:38,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:44:38,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:44:38,623 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:44:38,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:44:38,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:44:38,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:44:38,628 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:44:38,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:44:38,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:44:38,629 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:44:38,629 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:44:38,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:44:38,629 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:44:38,630 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:44:38,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:44:38,646 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:44:38,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:44:38,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:44:38,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:44:38,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:44:38,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:44:38,647 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:44:38,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:44:38,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:44:38,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:44:38,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:44:38,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:44:38,649 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 -> 9ab20fd2c170582703dc94cfdcd8e10a79137aac9ab76b1936884b512261ae10 [2024-10-10 23:44:38,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:44:38,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:44:38,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:44:38,941 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:44:38,942 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:44:38,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label05.c [2024-10-10 23:44:40,297 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:44:40,686 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:44:40,686 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label05.c [2024-10-10 23:44:40,707 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/60d1d94c5/b22415dfbfca46d88e2cc85962e65196/FLAG61f061ba3 [2024-10-10 23:44:40,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/60d1d94c5/b22415dfbfca46d88e2cc85962e65196 [2024-10-10 23:44:40,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:44:40,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:44:40,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:44:40,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:44:40,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:44:40,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:44:40" (1/1) ... [2024-10-10 23:44:40,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b6796c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:40, skipping insertion in model container [2024-10-10 23:44:40,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:44:40" (1/1) ... [2024-10-10 23:44:40,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:44:41,091 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_label05.c[9078,9091] [2024-10-10 23:44:41,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:44:41,795 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:44:41,830 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_label05.c[9078,9091] [2024-10-10 23:44:42,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:44:42,061 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:44:42,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:42 WrapperNode [2024-10-10 23:44:42,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:44:42,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:44:42,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:44:42,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:44:42,070 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:44:42" (1/1) ... [2024-10-10 23:44:42,121 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:44:42" (1/1) ... [2024-10-10 23:44:42,462 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-10 23:44:42,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:44:42,464 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:44:42,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:44:42,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:44:42,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:42" (1/1) ... [2024-10-10 23:44:42,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:42" (1/1) ... [2024-10-10 23:44:42,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:42" (1/1) ... [2024-10-10 23:44:42,655 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:44:42,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:42" (1/1) ... [2024-10-10 23:44:42,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:42" (1/1) ... [2024-10-10 23:44:42,767 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:42" (1/1) ... [2024-10-10 23:44:42,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:42" (1/1) ... [2024-10-10 23:44:42,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:42" (1/1) ... [2024-10-10 23:44:42,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:42" (1/1) ... [2024-10-10 23:44:42,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:44:42,880 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:44:42,880 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:44:42,881 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:44:42,881 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:42" (1/1) ... [2024-10-10 23:44:42,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:44:42,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:44:42,917 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:44:42,923 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:44:42,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:44:42,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:44:42,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:44:42,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:44:43,039 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:44:43,042 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:44:46,334 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-10 23:44:46,334 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:44:46,381 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:44:46,382 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:44:46,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:44:46 BoogieIcfgContainer [2024-10-10 23:44:46,382 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:44:46,384 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:44:46,384 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:44:46,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:44:46,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:44:40" (1/3) ... [2024-10-10 23:44:46,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b0caea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:44:46, skipping insertion in model container [2024-10-10 23:44:46,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:42" (2/3) ... [2024-10-10 23:44:46,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b0caea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:44:46, skipping insertion in model container [2024-10-10 23:44:46,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:44:46" (3/3) ... [2024-10-10 23:44:46,392 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label05.c [2024-10-10 23:44:46,411 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:44:46,411 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:44:46,498 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:44:46,505 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;@7814d5fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:44:46,506 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:44:46,513 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:44:46,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-10 23:44:46,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:46,521 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:44:46,521 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:46,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:46,527 INFO L85 PathProgramCache]: Analyzing trace with hash -2112828373, now seen corresponding path program 1 times [2024-10-10 23:44:46,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:46,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127563354] [2024-10-10 23:44:46,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:46,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:46,708 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:44:46,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:46,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127563354] [2024-10-10 23:44:46,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127563354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:46,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:46,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:44:46,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043939171] [2024-10-10 23:44:46,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:46,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:44:46,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:46,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:44:46,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:44:46,756 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 30.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:44:46,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:46,825 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-10 23:44:46,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:44:46,828 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-10-10 23:44:46,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:46,841 INFO L225 Difference]: With dead ends: 1055 [2024-10-10 23:44:46,842 INFO L226 Difference]: Without dead ends: 526 [2024-10-10 23:44:46,845 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:44:46,849 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:44:46,852 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:44:46,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-10 23:44:46,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-10 23:44:46,907 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:44:46,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-10 23:44:46,910 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 60 [2024-10-10 23:44:46,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:46,911 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-10 23:44:46,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:44:46,912 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-10 23:44:46,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-10 23:44:46,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:46,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:44:46,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:44:46,914 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:46,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:46,914 INFO L85 PathProgramCache]: Analyzing trace with hash 907783361, now seen corresponding path program 1 times [2024-10-10 23:44:46,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:46,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112892895] [2024-10-10 23:44:46,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:46,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:47,129 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:44:47,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:47,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112892895] [2024-10-10 23:44:47,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112892895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:47,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:47,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:44:47,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339577748] [2024-10-10 23:44:47,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:47,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:47,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:47,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:47,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:47,137 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:44:49,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:49,380 INFO L93 Difference]: Finished difference Result 1499 states and 2693 transitions. [2024-10-10 23:44:49,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:49,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-10-10 23:44:49,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:49,386 INFO L225 Difference]: With dead ends: 1499 [2024-10-10 23:44:49,386 INFO L226 Difference]: Without dead ends: 974 [2024-10-10 23:44:49,388 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:44:49,389 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 413 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 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.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:49,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 495 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:44:49,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-10-10 23:44:49,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 971. [2024-10-10 23:44:49,417 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:44:49,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1463 transitions. [2024-10-10 23:44:49,421 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1463 transitions. Word has length 60 [2024-10-10 23:44:49,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:49,421 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1463 transitions. [2024-10-10 23:44:49,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:44:49,421 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1463 transitions. [2024-10-10 23:44:49,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-10 23:44:49,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:49,425 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:44:49,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:44:49,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:49,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:49,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1335601236, now seen corresponding path program 1 times [2024-10-10 23:44:49,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:49,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537604649] [2024-10-10 23:44:49,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:49,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:49,725 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:44:49,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:49,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537604649] [2024-10-10 23:44:49,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537604649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:49,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:49,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:44:49,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610816147] [2024-10-10 23:44:49,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:49,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:49,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:49,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:49,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:49,728 INFO L87 Difference]: Start difference. First operand 971 states and 1463 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:44:52,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:52,086 INFO L93 Difference]: Finished difference Result 2813 states and 4241 transitions. [2024-10-10 23:44:52,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:52,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2024-10-10 23:44:52,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:52,094 INFO L225 Difference]: With dead ends: 2813 [2024-10-10 23:44:52,095 INFO L226 Difference]: Without dead ends: 1843 [2024-10-10 23:44:52,096 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:44:52,097 INFO L432 NwaCegarLoop]: 851 mSDtfsCounter, 430 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 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:44:52,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [430 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:44:52,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2024-10-10 23:44:52,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1841. [2024-10-10 23:44:52,129 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:44:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2503 transitions. [2024-10-10 23:44:52,134 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2503 transitions. Word has length 130 [2024-10-10 23:44:52,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:52,136 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2503 transitions. [2024-10-10 23:44:52,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states 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:44:52,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2503 transitions. [2024-10-10 23:44:52,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-10 23:44:52,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:52,146 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:44:52,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:44:52,146 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:52,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:52,147 INFO L85 PathProgramCache]: Analyzing trace with hash -140049903, now seen corresponding path program 1 times [2024-10-10 23:44:52,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:52,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549443223] [2024-10-10 23:44:52,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:52,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:52,457 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:44:52,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:52,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549443223] [2024-10-10 23:44:52,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549443223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:52,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:52,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:44:52,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242528150] [2024-10-10 23:44:52,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:52,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:52,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:52,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:52,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:52,463 INFO L87 Difference]: Start difference. First operand 1841 states and 2503 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states 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:44:54,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:54,368 INFO L93 Difference]: Finished difference Result 5394 states and 7325 transitions. [2024-10-10 23:44:54,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:54,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2024-10-10 23:44:54,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:54,378 INFO L225 Difference]: With dead ends: 5394 [2024-10-10 23:44:54,378 INFO L226 Difference]: Without dead ends: 2700 [2024-10-10 23:44:54,384 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:44:54,386 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:54,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 589 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:44:54,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2024-10-10 23:44:54,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2700. [2024-10-10 23:44:54,425 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:44:54,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 3217 transitions. [2024-10-10 23:44:54,429 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 3217 transitions. Word has length 152 [2024-10-10 23:44:54,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:54,431 INFO L471 AbstractCegarLoop]: Abstraction has 2700 states and 3217 transitions. [2024-10-10 23:44:54,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states 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:44:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 3217 transitions. [2024-10-10 23:44:54,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-10 23:44:54,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:54,439 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:44:54,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:44:54,440 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:54,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:54,441 INFO L85 PathProgramCache]: Analyzing trace with hash 930822622, now seen corresponding path program 1 times [2024-10-10 23:44:54,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:54,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090963812] [2024-10-10 23:44:54,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:54,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:54,692 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:44:54,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:54,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090963812] [2024-10-10 23:44:54,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090963812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:54,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:54,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:44:54,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875760473] [2024-10-10 23:44:54,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:54,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:54,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:54,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:54,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:54,695 INFO L87 Difference]: Start difference. First operand 2700 states and 3217 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states 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:44:56,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:56,236 INFO L93 Difference]: Finished difference Result 7107 states and 8597 transitions. [2024-10-10 23:44:56,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:56,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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 212 [2024-10-10 23:44:56,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:56,251 INFO L225 Difference]: With dead ends: 7107 [2024-10-10 23:44:56,251 INFO L226 Difference]: Without dead ends: 4408 [2024-10-10 23:44:56,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:56,257 INFO L432 NwaCegarLoop]: 724 mSDtfsCounter, 496 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:56,257 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.5s Time] [2024-10-10 23:44:56,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4408 states. [2024-10-10 23:44:56,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4408 to 4408. [2024-10-10 23:44:56,317 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:44:56,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4408 states to 4408 states and 5159 transitions. [2024-10-10 23:44:56,325 INFO L78 Accepts]: Start accepts. Automaton has 4408 states and 5159 transitions. Word has length 212 [2024-10-10 23:44:56,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:56,326 INFO L471 AbstractCegarLoop]: Abstraction has 4408 states and 5159 transitions. [2024-10-10 23:44:56,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states 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:44:56,326 INFO L276 IsEmpty]: Start isEmpty. Operand 4408 states and 5159 transitions. [2024-10-10 23:44:56,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-10 23:44:56,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:56,329 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:44:56,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:44:56,330 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:56,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:56,330 INFO L85 PathProgramCache]: Analyzing trace with hash 190720835, now seen corresponding path program 1 times [2024-10-10 23:44:56,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:56,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842131107] [2024-10-10 23:44:56,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:56,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-10 23:44:56,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:56,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842131107] [2024-10-10 23:44:56,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842131107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:56,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:56,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:44:56,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200818900] [2024-10-10 23:44:56,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:56,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:56,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:56,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:56,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:56,498 INFO L87 Difference]: Start difference. First operand 4408 states and 5159 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states 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:44:58,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:58,063 INFO L93 Difference]: Finished difference Result 10935 states and 12969 transitions. [2024-10-10 23:44:58,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:58,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 214 [2024-10-10 23:44:58,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:58,084 INFO L225 Difference]: With dead ends: 10935 [2024-10-10 23:44:58,084 INFO L226 Difference]: Without dead ends: 6527 [2024-10-10 23:44:58,089 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:44:58,090 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 389 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 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.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:58,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 442 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:44:58,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6527 states. [2024-10-10 23:44:58,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6527 to 4381. [2024-10-10 23:44:58,164 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:44:58,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 4381 states and 5118 transitions. [2024-10-10 23:44:58,176 INFO L78 Accepts]: Start accepts. Automaton has 4381 states and 5118 transitions. Word has length 214 [2024-10-10 23:44:58,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:58,176 INFO L471 AbstractCegarLoop]: Abstraction has 4381 states and 5118 transitions. [2024-10-10 23:44:58,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states 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:44:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand 4381 states and 5118 transitions. [2024-10-10 23:44:58,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-10-10 23:44:58,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:58,181 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:44:58,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:44:58,181 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:58,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:58,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1214414397, now seen corresponding path program 1 times [2024-10-10 23:44:58,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:58,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107565020] [2024-10-10 23:44:58,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:58,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:58,445 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:44:58,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:58,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107565020] [2024-10-10 23:44:58,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107565020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:58,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:58,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:44:58,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587531077] [2024-10-10 23:44:58,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:58,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:58,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:58,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:58,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:58,447 INFO L87 Difference]: Start difference. First operand 4381 states and 5118 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states 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:44:59,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:59,923 INFO L93 Difference]: Finished difference Result 10044 states and 11705 transitions. [2024-10-10 23:44:59,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:59,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 280 [2024-10-10 23:44:59,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:59,939 INFO L225 Difference]: With dead ends: 10044 [2024-10-10 23:44:59,939 INFO L226 Difference]: Without dead ends: 5664 [2024-10-10 23:44:59,945 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:44:59,945 INFO L432 NwaCegarLoop]: 831 mSDtfsCounter, 375 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:59,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 891 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:44:59,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5664 states. [2024-10-10 23:45:00,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5664 to 5233. [2024-10-10 23:45:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5233 states, 5232 states have (on average 1.1588302752293578) internal successors, (6063), 5232 states have internal predecessors, (6063), 0 states have call successors, (0), 0 states 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:45:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5233 states to 5233 states and 6063 transitions. [2024-10-10 23:45:00,027 INFO L78 Accepts]: Start accepts. Automaton has 5233 states and 6063 transitions. Word has length 280 [2024-10-10 23:45:00,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:00,028 INFO L471 AbstractCegarLoop]: Abstraction has 5233 states and 6063 transitions. [2024-10-10 23:45:00,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states 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:45:00,028 INFO L276 IsEmpty]: Start isEmpty. Operand 5233 states and 6063 transitions. [2024-10-10 23:45:00,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-10-10 23:45:00,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:00,032 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:45:00,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:45:00,033 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:00,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:00,033 INFO L85 PathProgramCache]: Analyzing trace with hash 415956001, now seen corresponding path program 1 times [2024-10-10 23:45:00,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:00,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552569797] [2024-10-10 23:45:00,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:00,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:00,380 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-10 23:45:00,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:00,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552569797] [2024-10-10 23:45:00,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552569797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:00,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:00,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:45:00,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332125988] [2024-10-10 23:45:00,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:00,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:45:00,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:00,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:45:00,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:45:00,384 INFO L87 Difference]: Start difference. First operand 5233 states and 6063 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states 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:45:02,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:02,271 INFO L93 Difference]: Finished difference Result 13048 states and 15221 transitions. [2024-10-10 23:45:02,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:45:02,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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 292 [2024-10-10 23:45:02,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:02,299 INFO L225 Difference]: With dead ends: 13048 [2024-10-10 23:45:02,300 INFO L226 Difference]: Without dead ends: 7388 [2024-10-10 23:45:02,307 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:45:02,309 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 495 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:02,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 625 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:45:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7388 states. [2024-10-10 23:45:02,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7388 to 6958. [2024-10-10 23:45:02,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6958 states, 6957 states have (on average 1.1637199942503953) internal successors, (8096), 6957 states have internal predecessors, (8096), 0 states have call successors, (0), 0 states 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:45:02,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6958 states to 6958 states and 8096 transitions. [2024-10-10 23:45:02,422 INFO L78 Accepts]: Start accepts. Automaton has 6958 states and 8096 transitions. Word has length 292 [2024-10-10 23:45:02,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:02,422 INFO L471 AbstractCegarLoop]: Abstraction has 6958 states and 8096 transitions. [2024-10-10 23:45:02,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states 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:45:02,426 INFO L276 IsEmpty]: Start isEmpty. Operand 6958 states and 8096 transitions. [2024-10-10 23:45:02,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-10-10 23:45:02,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:02,433 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:45:02,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:45:02,434 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:02,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:02,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1710105074, now seen corresponding path program 1 times [2024-10-10 23:45:02,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:02,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249216388] [2024-10-10 23:45:02,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:02,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:02,706 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-10 23:45:02,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:02,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249216388] [2024-10-10 23:45:02,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249216388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:02,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:02,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:45:02,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442639551] [2024-10-10 23:45:02,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:02,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:45:02,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:02,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:45:02,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:45:02,710 INFO L87 Difference]: Start difference. First operand 6958 states and 8096 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:45:04,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:04,327 INFO L93 Difference]: Finished difference Result 17315 states and 20392 transitions. [2024-10-10 23:45:04,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:45:04,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 297 [2024-10-10 23:45:04,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:04,345 INFO L225 Difference]: With dead ends: 17315 [2024-10-10 23:45:04,345 INFO L226 Difference]: Without dead ends: 10358 [2024-10-10 23:45:04,354 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:45:04,355 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 379 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:04,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 838 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:45:04,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10358 states. [2024-10-10 23:45:04,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10358 to 9508. [2024-10-10 23:45:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9508 states, 9507 states have (on average 1.1414747028505312) internal successors, (10852), 9507 states have internal predecessors, (10852), 0 states have call successors, (0), 0 states 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:45:04,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9508 states to 9508 states and 10852 transitions. [2024-10-10 23:45:04,498 INFO L78 Accepts]: Start accepts. Automaton has 9508 states and 10852 transitions. Word has length 297 [2024-10-10 23:45:04,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:04,499 INFO L471 AbstractCegarLoop]: Abstraction has 9508 states and 10852 transitions. [2024-10-10 23:45:04,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:45:04,500 INFO L276 IsEmpty]: Start isEmpty. Operand 9508 states and 10852 transitions. [2024-10-10 23:45:04,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2024-10-10 23:45:04,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:04,505 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 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:45:04,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:45:04,506 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:04,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:04,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1881496932, now seen corresponding path program 1 times [2024-10-10 23:45:04,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:04,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718265224] [2024-10-10 23:45:04,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:04,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:04,776 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:45:04,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:04,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718265224] [2024-10-10 23:45:04,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718265224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:04,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:04,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:45:04,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178593806] [2024-10-10 23:45:04,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:04,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:45:04,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:04,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:45:04,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:45:04,780 INFO L87 Difference]: Start difference. First operand 9508 states and 10852 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states 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:45:06,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:06,365 INFO L93 Difference]: Finished difference Result 22431 states and 25677 transitions. [2024-10-10 23:45:06,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:45:06,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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 315 [2024-10-10 23:45:06,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:06,388 INFO L225 Difference]: With dead ends: 22431 [2024-10-10 23:45:06,388 INFO L226 Difference]: Without dead ends: 12492 [2024-10-10 23:45:06,399 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:45:06,399 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 443 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:06,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 292 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:45:06,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12492 states. [2024-10-10 23:45:06,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12492 to 11636. [2024-10-10 23:45:06,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11636 states, 11635 states have (on average 1.147314138375591) internal successors, (13349), 11635 states have internal predecessors, (13349), 0 states have call successors, (0), 0 states 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:45:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11636 states to 11636 states and 13349 transitions. [2024-10-10 23:45:06,553 INFO L78 Accepts]: Start accepts. Automaton has 11636 states and 13349 transitions. Word has length 315 [2024-10-10 23:45:06,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:06,554 INFO L471 AbstractCegarLoop]: Abstraction has 11636 states and 13349 transitions. [2024-10-10 23:45:06,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states 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:45:06,555 INFO L276 IsEmpty]: Start isEmpty. Operand 11636 states and 13349 transitions. [2024-10-10 23:45:06,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-10-10 23:45:06,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:06,561 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:45:06,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:45:06,561 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:06,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:06,562 INFO L85 PathProgramCache]: Analyzing trace with hash 379211863, now seen corresponding path program 1 times [2024-10-10 23:45:06,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:06,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543673662] [2024-10-10 23:45:06,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:06,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:06,969 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:45:06,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:06,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543673662] [2024-10-10 23:45:06,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543673662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:06,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:06,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:45:06,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810965554] [2024-10-10 23:45:06,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:06,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:45:06,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:06,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:45:06,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:45:06,972 INFO L87 Difference]: Start difference. First operand 11636 states and 13349 transitions. Second operand has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states 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:45:09,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:09,693 INFO L93 Difference]: Finished difference Result 41233 states and 47494 transitions. [2024-10-10 23:45:09,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:45:09,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 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 320 [2024-10-10 23:45:09,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:09,746 INFO L225 Difference]: With dead ends: 41233 [2024-10-10 23:45:09,746 INFO L226 Difference]: Without dead ends: 28317 [2024-10-10 23:45:09,763 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:45:09,764 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 855 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 2795 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 3239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:09,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 333 Invalid, 3239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2795 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:45:09,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28317 states. [2024-10-10 23:45:10,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28317 to 27840. [2024-10-10 23:45:10,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27840 states, 27839 states have (on average 1.1353137684543266) internal successors, (31606), 27839 states have internal predecessors, (31606), 0 states have call successors, (0), 0 states 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:45:10,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27840 states to 27840 states and 31606 transitions. [2024-10-10 23:45:10,093 INFO L78 Accepts]: Start accepts. Automaton has 27840 states and 31606 transitions. Word has length 320 [2024-10-10 23:45:10,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:10,094 INFO L471 AbstractCegarLoop]: Abstraction has 27840 states and 31606 transitions. [2024-10-10 23:45:10,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states 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:45:10,094 INFO L276 IsEmpty]: Start isEmpty. Operand 27840 states and 31606 transitions. [2024-10-10 23:45:10,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-10-10 23:45:10,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:10,102 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:10,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:45:10,103 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:10,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:10,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1394076424, now seen corresponding path program 1 times [2024-10-10 23:45:10,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:10,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464164277] [2024-10-10 23:45:10,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:10,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:45:10,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:10,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464164277] [2024-10-10 23:45:10,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464164277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:10,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:10,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:45:10,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14071618] [2024-10-10 23:45:10,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:10,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:45:10,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:10,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:45:10,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:45:10,482 INFO L87 Difference]: Start difference. First operand 27840 states and 31606 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states 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:45:12,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:12,254 INFO L93 Difference]: Finished difference Result 68899 states and 78509 transitions. [2024-10-10 23:45:12,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:45:12,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 349 [2024-10-10 23:45:12,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:12,318 INFO L225 Difference]: With dead ends: 68899 [2024-10-10 23:45:12,318 INFO L226 Difference]: Without dead ends: 40631 [2024-10-10 23:45:12,347 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:45:12,348 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 422 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:12,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 424 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:45:12,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40631 states. [2024-10-10 23:45:12,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40631 to 38900. [2024-10-10 23:45:12,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38900 states, 38899 states have (on average 1.1130106172395178) internal successors, (43295), 38899 states have internal predecessors, (43295), 0 states have call successors, (0), 0 states 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:45:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38900 states to 38900 states and 43295 transitions. [2024-10-10 23:45:13,030 INFO L78 Accepts]: Start accepts. Automaton has 38900 states and 43295 transitions. Word has length 349 [2024-10-10 23:45:13,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:13,030 INFO L471 AbstractCegarLoop]: Abstraction has 38900 states and 43295 transitions. [2024-10-10 23:45:13,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states 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:45:13,031 INFO L276 IsEmpty]: Start isEmpty. Operand 38900 states and 43295 transitions. [2024-10-10 23:45:13,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-10-10 23:45:13,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:13,039 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2024-10-10 23:45:13,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:45:13,039 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:13,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:13,040 INFO L85 PathProgramCache]: Analyzing trace with hash -390231129, now seen corresponding path program 1 times [2024-10-10 23:45:13,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:13,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723678604] [2024-10-10 23:45:13,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:13,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:13,742 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 340 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:45:13,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:13,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723678604] [2024-10-10 23:45:13,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723678604] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:45:13,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975586714] [2024-10-10 23:45:13,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:13,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:45:13,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:45:13,746 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:45:13,747 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:45:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:13,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 23:45:13,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:45:14,479 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 304 proven. 82 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-10 23:45:14,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:45:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 304 proven. 82 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-10 23:45:15,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975586714] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:45:15,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:45:15,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2024-10-10 23:45:15,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430287082] [2024-10-10 23:45:15,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:45:15,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 23:45:15,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:15,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 23:45:15,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:45:15,596 INFO L87 Difference]: Start difference. First operand 38900 states and 43295 transitions. Second operand has 9 states, 9 states have (on average 93.22222222222223) internal successors, (839), 9 states have internal predecessors, (839), 0 states have call successors, (0), 0 states 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:45:27,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:27,030 INFO L93 Difference]: Finished difference Result 152361 states and 169505 transitions. [2024-10-10 23:45:27,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-10 23:45:27,031 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 93.22222222222223) internal successors, (839), 9 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 355 [2024-10-10 23:45:27,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:27,178 INFO L225 Difference]: With dead ends: 152361 [2024-10-10 23:45:27,179 INFO L226 Difference]: Without dead ends: 109201 [2024-10-10 23:45:27,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 720 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2024-10-10 23:45:27,222 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 10079 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 12777 mSolverCounterSat, 2189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10079 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 14966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2189 IncrementalHoareTripleChecker+Valid, 12777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:27,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10079 Valid, 583 Invalid, 14966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2189 Valid, 12777 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2024-10-10 23:45:27,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109201 states. [2024-10-10 23:45:28,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109201 to 84883. [2024-10-10 23:45:28,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84883 states, 84882 states have (on average 1.1077967060154097) internal successors, (94032), 84882 states have internal predecessors, (94032), 0 states have call successors, (0), 0 states 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:45:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84883 states to 84883 states and 94032 transitions. [2024-10-10 23:45:28,890 INFO L78 Accepts]: Start accepts. Automaton has 84883 states and 94032 transitions. Word has length 355 [2024-10-10 23:45:28,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:28,891 INFO L471 AbstractCegarLoop]: Abstraction has 84883 states and 94032 transitions. [2024-10-10 23:45:28,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.22222222222223) internal successors, (839), 9 states have internal predecessors, (839), 0 states have call successors, (0), 0 states 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:45:28,891 INFO L276 IsEmpty]: Start isEmpty. Operand 84883 states and 94032 transitions. [2024-10-10 23:45:28,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2024-10-10 23:45:28,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:28,901 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:45:28,919 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:45:29,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-10 23:45:29,102 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:29,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:29,103 INFO L85 PathProgramCache]: Analyzing trace with hash -771600700, now seen corresponding path program 1 times [2024-10-10 23:45:29,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:29,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575382600] [2024-10-10 23:45:29,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:29,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-10-10 23:45:29,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:29,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575382600] [2024-10-10 23:45:29,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575382600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:29,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:29,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:45:29,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765036075] [2024-10-10 23:45:29,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:29,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:45:29,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:29,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:45:29,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:45:29,773 INFO L87 Difference]: Start difference. First operand 84883 states and 94032 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states 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:45:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:31,971 INFO L93 Difference]: Finished difference Result 184277 states and 204050 transitions. [2024-10-10 23:45:31,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:45:31,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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 407 [2024-10-10 23:45:31,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:32,114 INFO L225 Difference]: With dead ends: 184277 [2024-10-10 23:45:32,114 INFO L226 Difference]: Without dead ends: 99395 [2024-10-10 23:45:32,145 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:45:32,147 INFO L432 NwaCegarLoop]: 778 mSDtfsCounter, 404 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:32,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 832 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:45:32,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99395 states. [2024-10-10 23:45:33,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99395 to 94670. [2024-10-10 23:45:33,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94670 states, 94669 states have (on average 1.1042368674011556) internal successors, (104537), 94669 states have internal predecessors, (104537), 0 states have call successors, (0), 0 states 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:45:33,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94670 states to 94670 states and 104537 transitions. [2024-10-10 23:45:33,508 INFO L78 Accepts]: Start accepts. Automaton has 94670 states and 104537 transitions. Word has length 407 [2024-10-10 23:45:33,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:33,508 INFO L471 AbstractCegarLoop]: Abstraction has 94670 states and 104537 transitions. [2024-10-10 23:45:33,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states 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:45:33,509 INFO L276 IsEmpty]: Start isEmpty. Operand 94670 states and 104537 transitions. [2024-10-10 23:45:33,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2024-10-10 23:45:33,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:33,518 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:33,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:45:33,518 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:33,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:33,519 INFO L85 PathProgramCache]: Analyzing trace with hash 659812379, now seen corresponding path program 1 times [2024-10-10 23:45:33,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:33,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827642516] [2024-10-10 23:45:33,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:33,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:34,038 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-10 23:45:34,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:34,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827642516] [2024-10-10 23:45:34,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827642516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:34,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:34,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:45:34,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429250510] [2024-10-10 23:45:34,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:34,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:45:34,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:34,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:45:34,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:45:34,043 INFO L87 Difference]: Start difference. First operand 94670 states and 104537 transitions. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states 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:45:35,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:35,854 INFO L93 Difference]: Finished difference Result 185499 states and 204811 transitions. [2024-10-10 23:45:35,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:45:35,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 429 [2024-10-10 23:45:35,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:35,962 INFO L225 Difference]: With dead ends: 185499 [2024-10-10 23:45:35,962 INFO L226 Difference]: Without dead ends: 91254 [2024-10-10 23:45:36,020 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:45:36,021 INFO L432 NwaCegarLoop]: 655 mSDtfsCounter, 440 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:36,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 717 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:45:36,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91254 states. [2024-10-10 23:45:37,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91254 to 89123. [2024-10-10 23:45:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89123 states, 89122 states have (on average 1.0789591795516258) internal successors, (96159), 89122 states have internal predecessors, (96159), 0 states have call successors, (0), 0 states 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:45:37,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89123 states to 89123 states and 96159 transitions. [2024-10-10 23:45:37,174 INFO L78 Accepts]: Start accepts. Automaton has 89123 states and 96159 transitions. Word has length 429 [2024-10-10 23:45:37,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:37,174 INFO L471 AbstractCegarLoop]: Abstraction has 89123 states and 96159 transitions. [2024-10-10 23:45:37,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states 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:45:37,175 INFO L276 IsEmpty]: Start isEmpty. Operand 89123 states and 96159 transitions. [2024-10-10 23:45:37,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2024-10-10 23:45:37,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:37,186 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:45:37,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:45:37,186 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:37,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:37,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1297935631, now seen corresponding path program 1 times [2024-10-10 23:45:37,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:37,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606986119] [2024-10-10 23:45:37,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:37,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:37,725 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-10 23:45:37,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:37,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606986119] [2024-10-10 23:45:37,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606986119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:37,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:37,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:45:37,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946655058] [2024-10-10 23:45:37,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:37,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:45:37,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:37,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:45:37,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:45:37,728 INFO L87 Difference]: Start difference. First operand 89123 states and 96159 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states 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:45:39,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:39,676 INFO L93 Difference]: Finished difference Result 187607 states and 202574 transitions. [2024-10-10 23:45:39,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:45:39,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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 485 [2024-10-10 23:45:39,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:39,792 INFO L225 Difference]: With dead ends: 187607 [2024-10-10 23:45:39,792 INFO L226 Difference]: Without dead ends: 98482 [2024-10-10 23:45:39,841 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:45:39,842 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 423 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:39,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 317 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:45:39,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98482 states. [2024-10-10 23:45:40,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98482 to 82300. [2024-10-10 23:45:40,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82300 states, 82299 states have (on average 1.075918297913705) internal successors, (88547), 82299 states have internal predecessors, (88547), 0 states have call successors, (0), 0 states 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:45:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82300 states to 82300 states and 88547 transitions. [2024-10-10 23:45:40,973 INFO L78 Accepts]: Start accepts. Automaton has 82300 states and 88547 transitions. Word has length 485 [2024-10-10 23:45:40,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:40,973 INFO L471 AbstractCegarLoop]: Abstraction has 82300 states and 88547 transitions. [2024-10-10 23:45:40,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states 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:45:40,973 INFO L276 IsEmpty]: Start isEmpty. Operand 82300 states and 88547 transitions. [2024-10-10 23:45:40,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2024-10-10 23:45:40,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:40,989 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:40,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:45:40,989 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:40,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:40,989 INFO L85 PathProgramCache]: Analyzing trace with hash 940347843, now seen corresponding path program 1 times [2024-10-10 23:45:40,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:40,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180533801] [2024-10-10 23:45:40,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:40,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:41,827 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-10 23:45:41,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:41,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180533801] [2024-10-10 23:45:41,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180533801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:41,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:41,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:45:41,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979236769] [2024-10-10 23:45:41,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:41,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:45:41,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:41,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:45:41,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:45:41,829 INFO L87 Difference]: Start difference. First operand 82300 states and 88547 transitions. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states 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:45:43,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:43,683 INFO L93 Difference]: Finished difference Result 175697 states and 188768 transitions. [2024-10-10 23:45:43,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:45:43,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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 594 [2024-10-10 23:45:43,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:43,773 INFO L225 Difference]: With dead ends: 175697 [2024-10-10 23:45:43,773 INFO L226 Difference]: Without dead ends: 93398 [2024-10-10 23:45:43,812 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:45:43,812 INFO L432 NwaCegarLoop]: 765 mSDtfsCounter, 403 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:43,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 819 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:45:43,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93398 states. [2024-10-10 23:45:44,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93398 to 82725. [2024-10-10 23:45:44,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82725 states, 82724 states have (on average 1.0747183405057783) internal successors, (88905), 82724 states have internal predecessors, (88905), 0 states have call successors, (0), 0 states 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:45:44,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82725 states to 82725 states and 88905 transitions. [2024-10-10 23:45:44,845 INFO L78 Accepts]: Start accepts. Automaton has 82725 states and 88905 transitions. Word has length 594 [2024-10-10 23:45:44,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:44,845 INFO L471 AbstractCegarLoop]: Abstraction has 82725 states and 88905 transitions. [2024-10-10 23:45:44,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states 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:45:44,845 INFO L276 IsEmpty]: Start isEmpty. Operand 82725 states and 88905 transitions. [2024-10-10 23:45:44,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2024-10-10 23:45:44,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:44,870 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:45:44,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:45:44,870 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:44,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:44,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1947438286, now seen corresponding path program 1 times [2024-10-10 23:45:44,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:44,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561041565] [2024-10-10 23:45:44,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:44,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 542 proven. 72 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-10 23:45:46,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:46,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561041565] [2024-10-10 23:45:46,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561041565] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:45:46,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024624374] [2024-10-10 23:45:46,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:46,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:45:46,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:45:46,088 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:45:46,089 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:45:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:46,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 23:45:46,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:45:46,581 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 391 proven. 59 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-10 23:45:46,582 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:45:46,773 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-10 23:45:46,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024624374] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:45:46,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:45:46,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8 [2024-10-10 23:45:46,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678999804] [2024-10-10 23:45:46,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:46,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:45:46,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:46,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:45:46,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:45:46,776 INFO L87 Difference]: Start difference. First operand 82725 states and 88905 transitions. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states 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:45:49,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:49,642 INFO L93 Difference]: Finished difference Result 181214 states and 194687 transitions. [2024-10-10 23:45:49,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:45:49,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 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 627 [2024-10-10 23:45:49,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:49,744 INFO L225 Difference]: With dead ends: 181214 [2024-10-10 23:45:49,744 INFO L226 Difference]: Without dead ends: 98062 [2024-10-10 23:45:49,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1257 GetRequests, 1250 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:45:49,803 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 935 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 2278 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 2278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:49,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 182 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 2278 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:45:49,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98062 states. [2024-10-10 23:45:50,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98062 to 92510. [2024-10-10 23:45:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92510 states, 92509 states have (on average 1.0758520792571533) internal successors, (99526), 92509 states have internal predecessors, (99526), 0 states have call successors, (0), 0 states 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:45:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92510 states to 92510 states and 99526 transitions. [2024-10-10 23:45:50,868 INFO L78 Accepts]: Start accepts. Automaton has 92510 states and 99526 transitions. Word has length 627 [2024-10-10 23:45:50,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:50,869 INFO L471 AbstractCegarLoop]: Abstraction has 92510 states and 99526 transitions. [2024-10-10 23:45:50,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states 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:45:50,869 INFO L276 IsEmpty]: Start isEmpty. Operand 92510 states and 99526 transitions. [2024-10-10 23:45:50,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2024-10-10 23:45:50,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:50,887 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:51,286 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forcibly destroying the process [2024-10-10 23:45:51,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 23:45:51,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-10 23:45:51,287 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:51,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:51,287 INFO L85 PathProgramCache]: Analyzing trace with hash -799209738, now seen corresponding path program 1 times [2024-10-10 23:45:51,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:51,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244147317] [2024-10-10 23:45:51,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:51,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:51,290 WARN L724 oredProcess$PipePump]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] The stream was forcibly closed: stdIn [2024-10-10 23:45:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2024-10-10 23:45:51,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:51,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244147317] [2024-10-10 23:45:51,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244147317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:51,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:51,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:45:51,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801592072] [2024-10-10 23:45:51,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:51,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:45:51,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:51,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:45:51,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:45:51,709 INFO L87 Difference]: Start difference. First operand 92510 states and 99526 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states 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:45:53,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:53,884 INFO L93 Difference]: Finished difference Result 188426 states and 202784 transitions. [2024-10-10 23:45:53,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:45:53,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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 646 [2024-10-10 23:45:53,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:53,992 INFO L225 Difference]: With dead ends: 188426 [2024-10-10 23:45:53,992 INFO L226 Difference]: Without dead ends: 96342 [2024-10-10 23:45:54,005 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:45:54,006 INFO L432 NwaCegarLoop]: 633 mSDtfsCounter, 504 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:54,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 678 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:45:54,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96342 states.