./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/Problem03_label24.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/Problem03_label24.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 c49e8ae23817aa2c6b4293aba2a0dafa15622f84ed9ad9570ae0d323ad70f2e2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:36:59,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:36:59,854 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:36:59,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:36:59,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:36:59,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:36:59,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:36:59,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:36:59,874 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:36:59,874 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:36:59,875 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:36:59,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:36:59,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:36:59,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:36:59,876 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:36:59,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:36:59,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:36:59,877 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:36:59,877 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:36:59,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:36:59,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:36:59,878 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:36:59,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:36:59,879 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:36:59,879 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:36:59,880 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:36:59,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:36:59,880 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:36:59,880 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:36:59,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:36:59,881 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:36:59,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:36:59,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:36:59,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:36:59,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:36:59,882 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:36:59,882 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:36:59,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:36:59,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:36:59,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:36:59,883 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:36:59,883 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:36:59,883 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 -> c49e8ae23817aa2c6b4293aba2a0dafa15622f84ed9ad9570ae0d323ad70f2e2 [2024-10-10 22:37:00,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:37:00,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:37:00,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:37:00,110 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:37:00,111 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:37:00,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label24.c [2024-10-10 22:37:01,500 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:37:01,812 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:37:01,813 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label24.c [2024-10-10 22:37:01,833 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/424f6806f/f9b2ff614b754d59ae60bd538a995ab7/FLAG56d7cc21e [2024-10-10 22:37:01,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/424f6806f/f9b2ff614b754d59ae60bd538a995ab7 [2024-10-10 22:37:01,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:37:01,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:37:01,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:37:01,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:37:01,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:37:01,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:37:01" (1/1) ... [2024-10-10 22:37:01,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c060db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:01, skipping insertion in model container [2024-10-10 22:37:01,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:37:01" (1/1) ... [2024-10-10 22:37:01,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:37:02,349 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/Problem03_label24.c[60015,60028] [2024-10-10 22:37:02,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:37:02,391 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:37:02,534 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/Problem03_label24.c[60015,60028] [2024-10-10 22:37:02,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:37:02,561 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:37:02,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:02 WrapperNode [2024-10-10 22:37:02,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:37:02,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:37:02,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:37:02,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:37:02,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:02" (1/1) ... [2024-10-10 22:37:02,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:02" (1/1) ... [2024-10-10 22:37:02,677 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-10-10 22:37:02,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:37:02,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:37:02,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:37:02,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:37:02,687 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:02" (1/1) ... [2024-10-10 22:37:02,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:02" (1/1) ... [2024-10-10 22:37:02,701 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:02" (1/1) ... [2024-10-10 22:37:02,732 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 22:37:02,733 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:02" (1/1) ... [2024-10-10 22:37:02,733 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:02" (1/1) ... [2024-10-10 22:37:02,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:02" (1/1) ... [2024-10-10 22:37:02,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:02" (1/1) ... [2024-10-10 22:37:02,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:02" (1/1) ... [2024-10-10 22:37:02,852 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:02" (1/1) ... [2024-10-10 22:37:02,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:37:02,864 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:37:02,864 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:37:02,864 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:37:02,865 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:02" (1/1) ... [2024-10-10 22:37:02,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:37:02,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:02,894 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 22:37:02,898 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 22:37:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:37:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:37:02,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:37:02,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:37:03,007 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:37:03,009 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:37:04,328 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-10 22:37:04,329 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:37:04,413 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:37:04,417 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:37:04,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:37:04 BoogieIcfgContainer [2024-10-10 22:37:04,417 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:37:04,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:37:04,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:37:04,422 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:37:04,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:37:01" (1/3) ... [2024-10-10 22:37:04,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d046715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:37:04, skipping insertion in model container [2024-10-10 22:37:04,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:37:02" (2/3) ... [2024-10-10 22:37:04,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d046715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:37:04, skipping insertion in model container [2024-10-10 22:37:04,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:37:04" (3/3) ... [2024-10-10 22:37:04,425 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label24.c [2024-10-10 22:37:04,437 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:37:04,438 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:37:04,500 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:37:04,507 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;@133b7e96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:37:04,507 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:37:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:04,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-10 22:37:04,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:04,528 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:04,529 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:04,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:04,533 INFO L85 PathProgramCache]: Analyzing trace with hash -2132970205, now seen corresponding path program 1 times [2024-10-10 22:37:04,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:04,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673563728] [2024-10-10 22:37:04,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:04,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:04,999 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 22:37:04,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:05,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673563728] [2024-10-10 22:37:05,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673563728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:05,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:05,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:05,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443930142] [2024-10-10 22:37:05,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:05,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:37:05,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:05,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:37:05,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:37:05,049 INFO L87 Difference]: Start difference. First operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 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 95.0) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:05,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:05,097 INFO L93 Difference]: Finished difference Result 479 states and 913 transitions. [2024-10-10 22:37:05,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:37:05,104 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 95.0) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 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 190 [2024-10-10 22:37:05,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:05,120 INFO L225 Difference]: With dead ends: 479 [2024-10-10 22:37:05,124 INFO L226 Difference]: Without dead ends: 238 [2024-10-10 22:37:05,127 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 22:37:05,133 INFO L432 NwaCegarLoop]: 392 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, 392 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 22:37:05,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:37:05,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-10 22:37:05,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-10 22:37:05,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:05,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2024-10-10 22:37:05,205 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 190 [2024-10-10 22:37:05,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:05,206 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2024-10-10 22:37:05,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 95.0) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:05,206 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2024-10-10 22:37:05,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-10 22:37:05,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:05,209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:05,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:37:05,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:05,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:05,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1857560011, now seen corresponding path program 1 times [2024-10-10 22:37:05,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:05,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217835927] [2024-10-10 22:37:05,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:05,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:05,832 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 22:37:05,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:05,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217835927] [2024-10-10 22:37:05,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217835927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:05,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:05,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:05,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160100570] [2024-10-10 22:37:05,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:05,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:05,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:05,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:05,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:05,837 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:06,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:06,651 INFO L93 Difference]: Finished difference Result 694 states and 1153 transitions. [2024-10-10 22:37:06,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:06,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 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 190 [2024-10-10 22:37:06,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:06,656 INFO L225 Difference]: With dead ends: 694 [2024-10-10 22:37:06,657 INFO L226 Difference]: Without dead ends: 457 [2024-10-10 22:37:06,658 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 22:37:06,659 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 43 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:06,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 105 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:37:06,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-10-10 22:37:06,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 446. [2024-10-10 22:37:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.5932584269662922) internal successors, (709), 445 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:06,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 709 transitions. [2024-10-10 22:37:06,678 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 709 transitions. Word has length 190 [2024-10-10 22:37:06,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:06,679 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 709 transitions. [2024-10-10 22:37:06,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:06,679 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 709 transitions. [2024-10-10 22:37:06,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-10 22:37:06,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:06,682 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:37:06,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:37:06,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:06,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:06,684 INFO L85 PathProgramCache]: Analyzing trace with hash -204508463, now seen corresponding path program 1 times [2024-10-10 22:37:06,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:06,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648820137] [2024-10-10 22:37:06,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:06,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:07,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:07,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:07,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648820137] [2024-10-10 22:37:07,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648820137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:07,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:07,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:07,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021246942] [2024-10-10 22:37:07,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:07,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:07,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:07,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:07,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:07,052 INFO L87 Difference]: Start difference. First operand 446 states and 709 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:07,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:07,722 INFO L93 Difference]: Finished difference Result 1297 states and 2070 transitions. [2024-10-10 22:37:07,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:07,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 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 196 [2024-10-10 22:37:07,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:07,726 INFO L225 Difference]: With dead ends: 1297 [2024-10-10 22:37:07,726 INFO L226 Difference]: Without dead ends: 852 [2024-10-10 22:37:07,728 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 22:37:07,729 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 214 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:07,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 192 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:37:07,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2024-10-10 22:37:07,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 852. [2024-10-10 22:37:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 851 states have (on average 1.3866039952996474) internal successors, (1180), 851 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:07,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1180 transitions. [2024-10-10 22:37:07,769 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1180 transitions. Word has length 196 [2024-10-10 22:37:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:07,769 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1180 transitions. [2024-10-10 22:37:07,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:07,770 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1180 transitions. [2024-10-10 22:37:07,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-10 22:37:07,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:07,774 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:37:07,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:37:07,774 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:07,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:07,775 INFO L85 PathProgramCache]: Analyzing trace with hash -482148718, now seen corresponding path program 1 times [2024-10-10 22:37:07,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:07,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586014344] [2024-10-10 22:37:07,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:07,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:07,949 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:37:07,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:07,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586014344] [2024-10-10 22:37:07,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586014344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:07,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:07,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:07,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478331225] [2024-10-10 22:37:07,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:07,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:07,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:07,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:07,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:07,952 INFO L87 Difference]: Start difference. First operand 852 states and 1180 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 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 22:37:08,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:08,664 INFO L93 Difference]: Finished difference Result 2535 states and 3517 transitions. [2024-10-10 22:37:08,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:08,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 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 204 [2024-10-10 22:37:08,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:08,669 INFO L225 Difference]: With dead ends: 2535 [2024-10-10 22:37:08,669 INFO L226 Difference]: Without dead ends: 1684 [2024-10-10 22:37:08,671 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 22:37:08,671 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:08,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 91 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:37:08,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2024-10-10 22:37:08,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1670. [2024-10-10 22:37:08,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1669 states have (on average 1.3576992210904733) internal successors, (2266), 1669 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2266 transitions. [2024-10-10 22:37:08,702 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2266 transitions. Word has length 204 [2024-10-10 22:37:08,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:08,702 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2266 transitions. [2024-10-10 22:37:08,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 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 22:37:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2266 transitions. [2024-10-10 22:37:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-10 22:37:08,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:08,706 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2024-10-10 22:37:08,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:37:08,707 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:08,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:08,708 INFO L85 PathProgramCache]: Analyzing trace with hash 225571907, now seen corresponding path program 1 times [2024-10-10 22:37:08,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:08,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395470422] [2024-10-10 22:37:08,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:08,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:09,002 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:37:09,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:09,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395470422] [2024-10-10 22:37:09,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395470422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:09,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:09,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:09,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482843420] [2024-10-10 22:37:09,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:09,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:09,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:09,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:09,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:09,008 INFO L87 Difference]: Start difference. First operand 1670 states and 2266 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:09,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:09,727 INFO L93 Difference]: Finished difference Result 4155 states and 5817 transitions. [2024-10-10 22:37:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:09,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 211 [2024-10-10 22:37:09,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:09,734 INFO L225 Difference]: With dead ends: 4155 [2024-10-10 22:37:09,735 INFO L226 Difference]: Without dead ends: 2486 [2024-10-10 22:37:09,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:09,737 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 235 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:09,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 404 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:37:09,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2024-10-10 22:37:09,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2484. [2024-10-10 22:37:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2484 states, 2483 states have (on average 1.2976238421264599) internal successors, (3222), 2483 states have internal predecessors, (3222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:09,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2484 states and 3222 transitions. [2024-10-10 22:37:09,784 INFO L78 Accepts]: Start accepts. Automaton has 2484 states and 3222 transitions. Word has length 211 [2024-10-10 22:37:09,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:09,784 INFO L471 AbstractCegarLoop]: Abstraction has 2484 states and 3222 transitions. [2024-10-10 22:37:09,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:09,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2484 states and 3222 transitions. [2024-10-10 22:37:09,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-10 22:37:09,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:09,790 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:09,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:37:09,790 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:09,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:09,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1157792317, now seen corresponding path program 1 times [2024-10-10 22:37:09,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:09,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760678683] [2024-10-10 22:37:09,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:09,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:10,197 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:37:10,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:10,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760678683] [2024-10-10 22:37:10,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760678683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:10,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:10,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:10,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695555598] [2024-10-10 22:37:10,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:10,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:10,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:10,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:10,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:10,203 INFO L87 Difference]: Start difference. First operand 2484 states and 3222 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:11,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:11,001 INFO L93 Difference]: Finished difference Result 6195 states and 8015 transitions. [2024-10-10 22:37:11,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:11,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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 218 [2024-10-10 22:37:11,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:11,015 INFO L225 Difference]: With dead ends: 6195 [2024-10-10 22:37:11,015 INFO L226 Difference]: Without dead ends: 3712 [2024-10-10 22:37:11,019 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 22:37:11,020 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 210 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:11,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 380 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:37:11,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3712 states. [2024-10-10 22:37:11,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3712 to 3705. [2024-10-10 22:37:11,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3705 states, 3704 states have (on average 1.2427105831533478) internal successors, (4603), 3704 states have internal predecessors, (4603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3705 states to 3705 states and 4603 transitions. [2024-10-10 22:37:11,088 INFO L78 Accepts]: Start accepts. Automaton has 3705 states and 4603 transitions. Word has length 218 [2024-10-10 22:37:11,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:11,089 INFO L471 AbstractCegarLoop]: Abstraction has 3705 states and 4603 transitions. [2024-10-10 22:37:11,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:11,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3705 states and 4603 transitions. [2024-10-10 22:37:11,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-10 22:37:11,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:11,096 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:11,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:37:11,096 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:11,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:11,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1327311928, now seen corresponding path program 1 times [2024-10-10 22:37:11,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:11,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105981181] [2024-10-10 22:37:11,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:11,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:11,568 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:37:11,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:11,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105981181] [2024-10-10 22:37:11,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105981181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:11,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:11,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:11,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142335010] [2024-10-10 22:37:11,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:11,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:37:11,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:11,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:37:11,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:37:11,571 INFO L87 Difference]: Start difference. First operand 3705 states and 4603 transitions. Second operand has 4 states, 4 states have (on average 58.5) 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 22:37:12,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:12,702 INFO L93 Difference]: Finished difference Result 8034 states and 10013 transitions. [2024-10-10 22:37:12,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:37:12,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) 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 234 [2024-10-10 22:37:12,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:12,712 INFO L225 Difference]: With dead ends: 8034 [2024-10-10 22:37:12,713 INFO L226 Difference]: Without dead ends: 4330 [2024-10-10 22:37:12,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:37:12,716 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 441 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:12,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 166 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 22:37:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2024-10-10 22:37:12,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 3705. [2024-10-10 22:37:12,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3705 states, 3704 states have (on average 1.2427105831533478) internal successors, (4603), 3704 states have internal predecessors, (4603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3705 states to 3705 states and 4603 transitions. [2024-10-10 22:37:12,773 INFO L78 Accepts]: Start accepts. Automaton has 3705 states and 4603 transitions. Word has length 234 [2024-10-10 22:37:12,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:12,773 INFO L471 AbstractCegarLoop]: Abstraction has 3705 states and 4603 transitions. [2024-10-10 22:37:12,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) 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 22:37:12,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3705 states and 4603 transitions. [2024-10-10 22:37:12,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-10 22:37:12,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:12,779 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:12,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:37:12,780 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:12,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:12,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1825997383, now seen corresponding path program 1 times [2024-10-10 22:37:12,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:12,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440315835] [2024-10-10 22:37:12,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:12,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:13,085 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:37:13,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:13,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440315835] [2024-10-10 22:37:13,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440315835] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:13,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173466495] [2024-10-10 22:37:13,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:13,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:13,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:13,089 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 22:37:13,093 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 22:37:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:13,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:37:13,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-10 22:37:13,479 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:13,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173466495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:13,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:13,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:37:13,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92426285] [2024-10-10 22:37:13,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:13,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:13,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:13,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:13,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:13,481 INFO L87 Difference]: Start difference. First operand 3705 states and 4603 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:14,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:14,137 INFO L93 Difference]: Finished difference Result 7423 states and 9233 transitions. [2024-10-10 22:37:14,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:14,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 241 [2024-10-10 22:37:14,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:14,147 INFO L225 Difference]: With dead ends: 7423 [2024-10-10 22:37:14,147 INFO L226 Difference]: Without dead ends: 3719 [2024-10-10 22:37:14,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:14,152 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 47 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:14,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 377 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:37:14,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2024-10-10 22:37:14,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3705. [2024-10-10 22:37:14,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3705 states, 3704 states have (on average 1.2273218142548596) internal successors, (4546), 3704 states have internal predecessors, (4546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:14,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3705 states to 3705 states and 4546 transitions. [2024-10-10 22:37:14,202 INFO L78 Accepts]: Start accepts. Automaton has 3705 states and 4546 transitions. Word has length 241 [2024-10-10 22:37:14,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:14,203 INFO L471 AbstractCegarLoop]: Abstraction has 3705 states and 4546 transitions. [2024-10-10 22:37:14,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:14,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3705 states and 4546 transitions. [2024-10-10 22:37:14,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-10-10 22:37:14,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:14,208 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:14,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 22:37:14,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:14,410 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:14,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:14,410 INFO L85 PathProgramCache]: Analyzing trace with hash 210847817, now seen corresponding path program 1 times [2024-10-10 22:37:14,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:14,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627338906] [2024-10-10 22:37:14,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:14,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-10 22:37:14,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:14,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627338906] [2024-10-10 22:37:14,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627338906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:14,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:14,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:14,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995022014] [2024-10-10 22:37:14,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:14,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:14,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:14,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:14,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:14,708 INFO L87 Difference]: Start difference. First operand 3705 states and 4546 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 2 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:15,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:15,566 INFO L93 Difference]: Finished difference Result 10879 states and 13376 transitions. [2024-10-10 22:37:15,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:15,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 2 states have internal predecessors, (222), 0 states have call successors, (0), 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 244 [2024-10-10 22:37:15,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:15,586 INFO L225 Difference]: With dead ends: 10879 [2024-10-10 22:37:15,586 INFO L226 Difference]: Without dead ends: 7378 [2024-10-10 22:37:15,592 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 22:37:15,594 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 216 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:15,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 193 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:37:15,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7378 states. [2024-10-10 22:37:15,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7378 to 7372. [2024-10-10 22:37:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7372 states, 7371 states have (on average 1.2006512006512007) internal successors, (8850), 7371 states have internal predecessors, (8850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:15,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7372 states to 7372 states and 8850 transitions. [2024-10-10 22:37:15,700 INFO L78 Accepts]: Start accepts. Automaton has 7372 states and 8850 transitions. Word has length 244 [2024-10-10 22:37:15,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:15,700 INFO L471 AbstractCegarLoop]: Abstraction has 7372 states and 8850 transitions. [2024-10-10 22:37:15,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 2 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:15,700 INFO L276 IsEmpty]: Start isEmpty. Operand 7372 states and 8850 transitions. [2024-10-10 22:37:15,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-10-10 22:37:15,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:15,711 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:37:15,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 22:37:15,711 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:15,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:15,712 INFO L85 PathProgramCache]: Analyzing trace with hash 356587913, now seen corresponding path program 1 times [2024-10-10 22:37:15,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:15,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770241141] [2024-10-10 22:37:15,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:15,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 22:37:15,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:15,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770241141] [2024-10-10 22:37:15,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770241141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:15,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:15,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:15,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830513] [2024-10-10 22:37:15,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:15,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:15,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:15,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:15,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:15,969 INFO L87 Difference]: Start difference. First operand 7372 states and 8850 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:16,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:16,651 INFO L93 Difference]: Finished difference Result 19637 states and 23686 transitions. [2024-10-10 22:37:16,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:16,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 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 257 [2024-10-10 22:37:16,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:16,680 INFO L225 Difference]: With dead ends: 19637 [2024-10-10 22:37:16,680 INFO L226 Difference]: Without dead ends: 12672 [2024-10-10 22:37:16,691 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 22:37:16,691 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 243 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:16,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 180 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:37:16,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12672 states. [2024-10-10 22:37:16,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12672 to 12058. [2024-10-10 22:37:16,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12058 states, 12057 states have (on average 1.1799784357634568) internal successors, (14227), 12057 states have internal predecessors, (14227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12058 states to 12058 states and 14227 transitions. [2024-10-10 22:37:16,855 INFO L78 Accepts]: Start accepts. Automaton has 12058 states and 14227 transitions. Word has length 257 [2024-10-10 22:37:16,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:16,855 INFO L471 AbstractCegarLoop]: Abstraction has 12058 states and 14227 transitions. [2024-10-10 22:37:16,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:16,856 INFO L276 IsEmpty]: Start isEmpty. Operand 12058 states and 14227 transitions. [2024-10-10 22:37:16,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-10-10 22:37:16,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:16,869 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:16,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 22:37:16,870 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:16,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:16,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1805841498, now seen corresponding path program 1 times [2024-10-10 22:37:16,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:16,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895039596] [2024-10-10 22:37:16,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:16,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:17,168 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-10 22:37:17,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:17,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895039596] [2024-10-10 22:37:17,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895039596] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:17,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745325432] [2024-10-10 22:37:17,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:17,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:17,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:17,171 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 22:37:17,172 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 22:37:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:17,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:37:17,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:17,337 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:37:17,337 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:17,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745325432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:17,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:17,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:37:17,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31857789] [2024-10-10 22:37:17,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:17,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:17,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:17,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:17,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:17,339 INFO L87 Difference]: Start difference. First operand 12058 states and 14227 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 22:37:18,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:18,000 INFO L93 Difference]: Finished difference Result 27574 states and 32802 transitions. [2024-10-10 22:37:18,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:18,001 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 262 [2024-10-10 22:37:18,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:18,025 INFO L225 Difference]: With dead ends: 27574 [2024-10-10 22:37:18,026 INFO L226 Difference]: Without dead ends: 15923 [2024-10-10 22:37:18,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:18,039 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 214 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:18,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 392 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:37:18,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15923 states. [2024-10-10 22:37:18,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15923 to 15713. [2024-10-10 22:37:18,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15713 states, 15712 states have (on average 1.1719068228105907) internal successors, (18413), 15712 states have internal predecessors, (18413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:18,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15713 states to 15713 states and 18413 transitions. [2024-10-10 22:37:18,296 INFO L78 Accepts]: Start accepts. Automaton has 15713 states and 18413 transitions. Word has length 262 [2024-10-10 22:37:18,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:18,296 INFO L471 AbstractCegarLoop]: Abstraction has 15713 states and 18413 transitions. [2024-10-10 22:37:18,296 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 22:37:18,296 INFO L276 IsEmpty]: Start isEmpty. Operand 15713 states and 18413 transitions. [2024-10-10 22:37:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-10-10 22:37:18,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:18,315 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:18,329 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 22:37:18,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:18,520 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:18,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:18,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1411232673, now seen corresponding path program 1 times [2024-10-10 22:37:18,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:18,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657214616] [2024-10-10 22:37:18,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:18,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:18,720 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-10 22:37:18,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:18,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657214616] [2024-10-10 22:37:18,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657214616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:18,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:18,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:18,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066121072] [2024-10-10 22:37:18,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:18,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:37:18,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:18,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:37:18,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:37:18,722 INFO L87 Difference]: Start difference. First operand 15713 states and 18413 transitions. Second operand has 4 states, 4 states have (on average 53.75) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:19,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:19,494 INFO L93 Difference]: Finished difference Result 32409 states and 38215 transitions. [2024-10-10 22:37:19,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:37:19,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 269 [2024-10-10 22:37:19,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:19,518 INFO L225 Difference]: With dead ends: 32409 [2024-10-10 22:37:19,518 INFO L226 Difference]: Without dead ends: 17103 [2024-10-10 22:37:19,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:37:19,533 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 580 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:19,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 51 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:37:19,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17103 states. [2024-10-10 22:37:19,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17103 to 17097. [2024-10-10 22:37:19,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17097 states, 17096 states have (on average 1.143600842302293) internal successors, (19551), 17096 states have internal predecessors, (19551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:19,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17097 states to 17097 states and 19551 transitions. [2024-10-10 22:37:19,704 INFO L78 Accepts]: Start accepts. Automaton has 17097 states and 19551 transitions. Word has length 269 [2024-10-10 22:37:19,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:19,704 INFO L471 AbstractCegarLoop]: Abstraction has 17097 states and 19551 transitions. [2024-10-10 22:37:19,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:19,705 INFO L276 IsEmpty]: Start isEmpty. Operand 17097 states and 19551 transitions. [2024-10-10 22:37:19,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-10-10 22:37:19,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:19,720 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:19,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 22:37:19,720 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:19,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:19,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1599753880, now seen corresponding path program 1 times [2024-10-10 22:37:19,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:19,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080174686] [2024-10-10 22:37:19,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:19,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:20,013 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:37:20,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:20,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080174686] [2024-10-10 22:37:20,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080174686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:20,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:20,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:20,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548598096] [2024-10-10 22:37:20,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:20,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:20,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:20,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:20,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:20,016 INFO L87 Difference]: Start difference. First operand 17097 states and 19551 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 2 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:20,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:20,629 INFO L93 Difference]: Finished difference Result 39696 states and 45614 transitions. [2024-10-10 22:37:20,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:20,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 2 states have internal predecessors, (266), 0 states have call successors, (0), 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 271 [2024-10-10 22:37:20,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:20,676 INFO L225 Difference]: With dead ends: 39696 [2024-10-10 22:37:20,676 INFO L226 Difference]: Without dead ends: 23006 [2024-10-10 22:37:20,695 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 22:37:20,696 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 160 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:20,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 118 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:37:20,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23006 states. [2024-10-10 22:37:20,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23006 to 21167. [2024-10-10 22:37:20,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21167 states, 21166 states have (on average 1.1587924029103278) internal successors, (24527), 21166 states have internal predecessors, (24527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:20,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21167 states to 21167 states and 24527 transitions. [2024-10-10 22:37:20,978 INFO L78 Accepts]: Start accepts. Automaton has 21167 states and 24527 transitions. Word has length 271 [2024-10-10 22:37:20,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:20,979 INFO L471 AbstractCegarLoop]: Abstraction has 21167 states and 24527 transitions. [2024-10-10 22:37:20,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 2 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:20,979 INFO L276 IsEmpty]: Start isEmpty. Operand 21167 states and 24527 transitions. [2024-10-10 22:37:20,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-10-10 22:37:20,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:20,994 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 22:37:20,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 22:37:20,994 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:20,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:20,994 INFO L85 PathProgramCache]: Analyzing trace with hash -362572784, now seen corresponding path program 1 times [2024-10-10 22:37:20,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:20,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127747268] [2024-10-10 22:37:20,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:20,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:37:21,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:21,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127747268] [2024-10-10 22:37:21,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127747268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:21,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:21,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:21,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248762142] [2024-10-10 22:37:21,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:21,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:37:21,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:21,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:37:21,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:37:21,284 INFO L87 Difference]: Start difference. First operand 21167 states and 24527 transitions. Second operand has 4 states, 4 states have (on average 73.25) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:22,137 INFO L93 Difference]: Finished difference Result 42548 states and 49383 transitions. [2024-10-10 22:37:22,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:37:22,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.25) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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 298 [2024-10-10 22:37:22,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:22,177 INFO L225 Difference]: With dead ends: 42548 [2024-10-10 22:37:22,181 INFO L226 Difference]: Without dead ends: 21588 [2024-10-10 22:37:22,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:37:22,215 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 355 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:22,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 74 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:37:22,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21588 states. [2024-10-10 22:37:22,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21588 to 20969. [2024-10-10 22:37:22,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20969 states, 20968 states have (on average 1.104826402136589) internal successors, (23166), 20968 states have internal predecessors, (23166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20969 states to 20969 states and 23166 transitions. [2024-10-10 22:37:22,423 INFO L78 Accepts]: Start accepts. Automaton has 20969 states and 23166 transitions. Word has length 298 [2024-10-10 22:37:22,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:22,423 INFO L471 AbstractCegarLoop]: Abstraction has 20969 states and 23166 transitions. [2024-10-10 22:37:22,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.25) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:22,423 INFO L276 IsEmpty]: Start isEmpty. Operand 20969 states and 23166 transitions. [2024-10-10 22:37:22,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-10-10 22:37:22,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:22,436 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:22,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 22:37:22,436 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:22,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:22,437 INFO L85 PathProgramCache]: Analyzing trace with hash -453389463, now seen corresponding path program 1 times [2024-10-10 22:37:22,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:22,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246200453] [2024-10-10 22:37:22,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:22,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-10 22:37:22,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:22,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246200453] [2024-10-10 22:37:22,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246200453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:22,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:22,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:22,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645113020] [2024-10-10 22:37:22,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:22,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:22,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:22,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:22,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:22,867 INFO L87 Difference]: Start difference. First operand 20969 states and 23166 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 2 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:23,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:23,539 INFO L93 Difference]: Finished difference Result 49679 states and 54996 transitions. [2024-10-10 22:37:23,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:23,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 2 states have internal predecessors, (222), 0 states have call successors, (0), 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 301 [2024-10-10 22:37:23,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:23,581 INFO L225 Difference]: With dead ends: 49679 [2024-10-10 22:37:23,582 INFO L226 Difference]: Without dead ends: 29526 [2024-10-10 22:37:23,603 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 22:37:23,603 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 200 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:23,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 108 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:37:23,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29526 states. [2024-10-10 22:37:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29526 to 29512. [2024-10-10 22:37:23,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29512 states, 29511 states have (on average 1.1052150045745655) internal successors, (32616), 29511 states have internal predecessors, (32616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:23,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29512 states to 29512 states and 32616 transitions. [2024-10-10 22:37:23,920 INFO L78 Accepts]: Start accepts. Automaton has 29512 states and 32616 transitions. Word has length 301 [2024-10-10 22:37:23,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:23,920 INFO L471 AbstractCegarLoop]: Abstraction has 29512 states and 32616 transitions. [2024-10-10 22:37:23,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 2 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:23,920 INFO L276 IsEmpty]: Start isEmpty. Operand 29512 states and 32616 transitions. [2024-10-10 22:37:23,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-10-10 22:37:23,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:23,939 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-10-10 22:37:23,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 22:37:23,940 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:23,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:23,940 INFO L85 PathProgramCache]: Analyzing trace with hash 867565500, now seen corresponding path program 1 times [2024-10-10 22:37:23,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:23,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784201849] [2024-10-10 22:37:23,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:23,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:24,447 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-10-10 22:37:24,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:24,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784201849] [2024-10-10 22:37:24,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784201849] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:24,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29485974] [2024-10-10 22:37:24,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:24,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:24,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:24,452 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:24,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 22:37:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:24,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:37:24,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:24,855 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-10 22:37:24,855 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:24,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29485974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:24,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:24,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:37:24,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10902713] [2024-10-10 22:37:24,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:24,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:24,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:24,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:24,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:24,857 INFO L87 Difference]: Start difference. First operand 29512 states and 32616 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:25,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:25,434 INFO L93 Difference]: Finished difference Result 55771 states and 61602 transitions. [2024-10-10 22:37:25,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:25,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 316 [2024-10-10 22:37:25,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:25,465 INFO L225 Difference]: With dead ends: 55771 [2024-10-10 22:37:25,466 INFO L226 Difference]: Without dead ends: 28499 [2024-10-10 22:37:25,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:25,487 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 65 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:25,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 78 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:37:25,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28499 states. [2024-10-10 22:37:25,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28499 to 27074. [2024-10-10 22:37:25,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27074 states, 27073 states have (on average 1.0923429246851106) internal successors, (29573), 27073 states have internal predecessors, (29573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:26,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27074 states to 27074 states and 29573 transitions. [2024-10-10 22:37:26,020 INFO L78 Accepts]: Start accepts. Automaton has 27074 states and 29573 transitions. Word has length 316 [2024-10-10 22:37:26,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:26,021 INFO L471 AbstractCegarLoop]: Abstraction has 27074 states and 29573 transitions. [2024-10-10 22:37:26,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 27074 states and 29573 transitions. [2024-10-10 22:37:26,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-10-10 22:37:26,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:26,040 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 22:37:26,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 22:37:26,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:26,241 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:26,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:26,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1393519977, now seen corresponding path program 1 times [2024-10-10 22:37:26,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:26,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738141058] [2024-10-10 22:37:26,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:26,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-10 22:37:26,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:26,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738141058] [2024-10-10 22:37:26,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738141058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:26,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:26,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:26,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624050337] [2024-10-10 22:37:26,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:26,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:26,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:26,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:26,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:26,689 INFO L87 Difference]: Start difference. First operand 27074 states and 29573 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:27,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:27,523 INFO L93 Difference]: Finished difference Result 56798 states and 62086 transitions. [2024-10-10 22:37:27,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:27,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 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 22:37:27,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:27,571 INFO L225 Difference]: With dead ends: 56798 [2024-10-10 22:37:27,572 INFO L226 Difference]: Without dead ends: 33388 [2024-10-10 22:37:27,596 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 22:37:27,596 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 212 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:27,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 115 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:37:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2024-10-10 22:37:28,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33385. [2024-10-10 22:37:28,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33385 states, 33384 states have (on average 1.0907320872274144) internal successors, (36413), 33384 states have internal predecessors, (36413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:28,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33385 states to 33385 states and 36413 transitions. [2024-10-10 22:37:28,131 INFO L78 Accepts]: Start accepts. Automaton has 33385 states and 36413 transitions. Word has length 320 [2024-10-10 22:37:28,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:28,131 INFO L471 AbstractCegarLoop]: Abstraction has 33385 states and 36413 transitions. [2024-10-10 22:37:28,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:28,132 INFO L276 IsEmpty]: Start isEmpty. Operand 33385 states and 36413 transitions. [2024-10-10 22:37:28,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2024-10-10 22:37:28,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:28,150 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:28,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 22:37:28,150 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:28,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:28,151 INFO L85 PathProgramCache]: Analyzing trace with hash -844830290, now seen corresponding path program 1 times [2024-10-10 22:37:28,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:28,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348736191] [2024-10-10 22:37:28,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:28,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:28,649 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 203 proven. 48 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-10 22:37:28,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:28,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348736191] [2024-10-10 22:37:28,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348736191] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:28,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331777894] [2024-10-10 22:37:28,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:28,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:28,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:28,653 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:28,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 22:37:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:28,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:37:28,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:28,974 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-10 22:37:28,974 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:28,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331777894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:28,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:28,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 22:37:28,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196413522] [2024-10-10 22:37:28,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:28,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:28,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:28,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:28,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:28,976 INFO L87 Difference]: Start difference. First operand 33385 states and 36413 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:29,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:29,362 INFO L93 Difference]: Finished difference Result 82244 states and 89686 transitions. [2024-10-10 22:37:29,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:29,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 367 [2024-10-10 22:37:29,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:29,429 INFO L225 Difference]: With dead ends: 82244 [2024-10-10 22:37:29,429 INFO L226 Difference]: Without dead ends: 52726 [2024-10-10 22:37:29,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:29,458 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 192 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:29,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 475 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:37:29,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52726 states. [2024-10-10 22:37:30,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52726 to 52720. [2024-10-10 22:37:30,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52720 states, 52719 states have (on average 1.0886777063297863) internal successors, (57394), 52719 states have internal predecessors, (57394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:30,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52720 states to 52720 states and 57394 transitions. [2024-10-10 22:37:30,133 INFO L78 Accepts]: Start accepts. Automaton has 52720 states and 57394 transitions. Word has length 367 [2024-10-10 22:37:30,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:30,133 INFO L471 AbstractCegarLoop]: Abstraction has 52720 states and 57394 transitions. [2024-10-10 22:37:30,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:30,134 INFO L276 IsEmpty]: Start isEmpty. Operand 52720 states and 57394 transitions. [2024-10-10 22:37:30,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-10-10 22:37:30,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:30,157 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 22:37:30,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-10 22:37:30,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-10 22:37:30,358 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:30,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:30,358 INFO L85 PathProgramCache]: Analyzing trace with hash 891987366, now seen corresponding path program 1 times [2024-10-10 22:37:30,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:30,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224142799] [2024-10-10 22:37:30,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:30,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:31,023 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-10-10 22:37:31,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:31,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224142799] [2024-10-10 22:37:31,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224142799] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:31,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146682984] [2024-10-10 22:37:31,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:31,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:31,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:31,026 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:37:31,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 22:37:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:31,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:37:31,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:31,448 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-10-10 22:37:31,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:31,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146682984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:31,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:31,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:37:31,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433345855] [2024-10-10 22:37:31,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:31,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:31,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:31,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:31,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:31,450 INFO L87 Difference]: Start difference. First operand 52720 states and 57394 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:32,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:32,121 INFO L93 Difference]: Finished difference Result 96701 states and 105523 transitions. [2024-10-10 22:37:32,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:32,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 408 [2024-10-10 22:37:32,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:32,177 INFO L225 Difference]: With dead ends: 96701 [2024-10-10 22:37:32,178 INFO L226 Difference]: Without dead ends: 44999 [2024-10-10 22:37:32,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:37:32,212 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 73 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:32,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 272 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:37:32,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44999 states. [2024-10-10 22:37:32,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44999 to 44173. [2024-10-10 22:37:32,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44173 states, 44172 states have (on average 1.084804853753509) internal successors, (47918), 44172 states have internal predecessors, (47918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:32,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44173 states to 44173 states and 47918 transitions. [2024-10-10 22:37:32,825 INFO L78 Accepts]: Start accepts. Automaton has 44173 states and 47918 transitions. Word has length 408 [2024-10-10 22:37:32,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:32,825 INFO L471 AbstractCegarLoop]: Abstraction has 44173 states and 47918 transitions. [2024-10-10 22:37:32,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:32,826 INFO L276 IsEmpty]: Start isEmpty. Operand 44173 states and 47918 transitions. [2024-10-10 22:37:32,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2024-10-10 22:37:32,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:32,851 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 22:37:32,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-10 22:37:33,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:33,052 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:33,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:33,052 INFO L85 PathProgramCache]: Analyzing trace with hash -694586847, now seen corresponding path program 1 times [2024-10-10 22:37:33,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:33,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937948640] [2024-10-10 22:37:33,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:33,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:33,832 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2024-10-10 22:37:33,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:33,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937948640] [2024-10-10 22:37:33,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937948640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:33,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:33,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:33,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265060035] [2024-10-10 22:37:33,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:33,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:33,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:33,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:33,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:33,834 INFO L87 Difference]: Start difference. First operand 44173 states and 47918 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 2 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:34,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:34,459 INFO L93 Difference]: Finished difference Result 93843 states and 101793 transitions. [2024-10-10 22:37:34,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:34,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 2 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 498 [2024-10-10 22:37:34,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:34,526 INFO L225 Difference]: With dead ends: 93843 [2024-10-10 22:37:34,526 INFO L226 Difference]: Without dead ends: 50688 [2024-10-10 22:37:34,557 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 22:37:34,559 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 101 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:34,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 94 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:37:34,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50688 states. [2024-10-10 22:37:35,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50688 to 49463. [2024-10-10 22:37:35,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49463 states, 49462 states have (on average 1.0816586470421738) internal successors, (53501), 49462 states have internal predecessors, (53501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:35,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49463 states to 49463 states and 53501 transitions. [2024-10-10 22:37:35,152 INFO L78 Accepts]: Start accepts. Automaton has 49463 states and 53501 transitions. Word has length 498 [2024-10-10 22:37:35,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:35,153 INFO L471 AbstractCegarLoop]: Abstraction has 49463 states and 53501 transitions. [2024-10-10 22:37:35,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 2 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:35,153 INFO L276 IsEmpty]: Start isEmpty. Operand 49463 states and 53501 transitions. [2024-10-10 22:37:35,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2024-10-10 22:37:35,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:35,184 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:35,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 22:37:35,185 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:35,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:35,185 INFO L85 PathProgramCache]: Analyzing trace with hash 958373882, now seen corresponding path program 1 times [2024-10-10 22:37:35,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:35,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234206194] [2024-10-10 22:37:35,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:35,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-10-10 22:37:35,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:35,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234206194] [2024-10-10 22:37:35,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234206194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:35,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:35,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:37:35,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645581350] [2024-10-10 22:37:35,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:35,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:35,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:35,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:35,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:35,708 INFO L87 Difference]: Start difference. First operand 49463 states and 53501 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 2 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:36,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:36,209 INFO L93 Difference]: Finished difference Result 124183 states and 134534 transitions. [2024-10-10 22:37:36,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:36,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 2 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 524 [2024-10-10 22:37:36,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:36,306 INFO L225 Difference]: With dead ends: 124183 [2024-10-10 22:37:36,306 INFO L226 Difference]: Without dead ends: 75737 [2024-10-10 22:37:36,348 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 22:37:36,349 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 179 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:36,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 472 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:37:36,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75737 states. [2024-10-10 22:37:37,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75737 to 75733. [2024-10-10 22:37:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75733 states, 75732 states have (on average 1.0836238314054825) internal successors, (82065), 75732 states have internal predecessors, (82065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:37,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75733 states to 75733 states and 82065 transitions. [2024-10-10 22:37:37,391 INFO L78 Accepts]: Start accepts. Automaton has 75733 states and 82065 transitions. Word has length 524 [2024-10-10 22:37:37,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:37,392 INFO L471 AbstractCegarLoop]: Abstraction has 75733 states and 82065 transitions. [2024-10-10 22:37:37,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 2 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:37,392 INFO L276 IsEmpty]: Start isEmpty. Operand 75733 states and 82065 transitions. [2024-10-10 22:37:37,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2024-10-10 22:37:37,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:37,425 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 22:37:37,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 22:37:37,426 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:37,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:37,427 INFO L85 PathProgramCache]: Analyzing trace with hash 480088466, now seen corresponding path program 1 times [2024-10-10 22:37:37,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:37,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207078910] [2024-10-10 22:37:37,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:37,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:37,796 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 444 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2024-10-10 22:37:37,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:37,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207078910] [2024-10-10 22:37:37,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207078910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:37,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:37:37,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:37:37,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080360893] [2024-10-10 22:37:37,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:37,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:37,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:37,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:37,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:37:37,798 INFO L87 Difference]: Start difference. First operand 75733 states and 82065 transitions. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:38,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:38,649 INFO L93 Difference]: Finished difference Result 164052 states and 178185 transitions. [2024-10-10 22:37:38,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:38,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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 535 [2024-10-10 22:37:38,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:39,004 INFO L225 Difference]: With dead ends: 164052 [2024-10-10 22:37:39,005 INFO L226 Difference]: Without dead ends: 94421 [2024-10-10 22:37:39,046 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 22:37:39,046 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 212 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:39,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 306 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:37:39,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94421 states. [2024-10-10 22:37:40,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94421 to 91768. [2024-10-10 22:37:40,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91768 states, 91767 states have (on average 1.0721283249970033) internal successors, (98386), 91767 states have internal predecessors, (98386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:40,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91768 states to 91768 states and 98386 transitions. [2024-10-10 22:37:40,304 INFO L78 Accepts]: Start accepts. Automaton has 91768 states and 98386 transitions. Word has length 535 [2024-10-10 22:37:40,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:40,304 INFO L471 AbstractCegarLoop]: Abstraction has 91768 states and 98386 transitions. [2024-10-10 22:37:40,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:40,305 INFO L276 IsEmpty]: Start isEmpty. Operand 91768 states and 98386 transitions. [2024-10-10 22:37:40,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2024-10-10 22:37:40,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:40,350 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 22:37:40,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-10 22:37:40,350 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:40,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:40,350 INFO L85 PathProgramCache]: Analyzing trace with hash -436604538, now seen corresponding path program 1 times [2024-10-10 22:37:40,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:40,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244608180] [2024-10-10 22:37:40,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:40,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:41,278 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 392 proven. 9 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-10-10 22:37:41,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:41,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244608180] [2024-10-10 22:37:41,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244608180] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:41,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870133499] [2024-10-10 22:37:41,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:41,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:41,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:41,281 INFO L229 MonitoredProcess]: Starting monitored process 7 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 22:37:41,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-10 22:37:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:41,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:37:41,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 533 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2024-10-10 22:37:41,538 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:41,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870133499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:41,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:41,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 22:37:41,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085625679] [2024-10-10 22:37:41,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:41,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:41,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:41,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:41,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:37:41,540 INFO L87 Difference]: Start difference. First operand 91768 states and 98386 transitions. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:42,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:42,407 INFO L93 Difference]: Finished difference Result 223976 states and 240294 transitions. [2024-10-10 22:37:42,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:42,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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 541 [2024-10-10 22:37:42,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:42,577 INFO L225 Difference]: With dead ends: 223976 [2024-10-10 22:37:42,578 INFO L226 Difference]: Without dead ends: 136277 [2024-10-10 22:37:42,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:37:42,617 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 214 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:42,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 691 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:37:42,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136277 states. [2024-10-10 22:37:44,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136277 to 135871. [2024-10-10 22:37:44,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135871 states, 135870 states have (on average 1.0639876352395672) internal successors, (144564), 135870 states have internal predecessors, (144564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:44,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135871 states to 135871 states and 144564 transitions. [2024-10-10 22:37:44,693 INFO L78 Accepts]: Start accepts. Automaton has 135871 states and 144564 transitions. Word has length 541 [2024-10-10 22:37:44,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:44,694 INFO L471 AbstractCegarLoop]: Abstraction has 135871 states and 144564 transitions. [2024-10-10 22:37:44,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:44,694 INFO L276 IsEmpty]: Start isEmpty. Operand 135871 states and 144564 transitions. [2024-10-10 22:37:44,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2024-10-10 22:37:44,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:44,757 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 22:37:44,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-10 22:37:44,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-10 22:37:44,959 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:44,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:44,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1618878187, now seen corresponding path program 1 times [2024-10-10 22:37:44,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:44,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145790751] [2024-10-10 22:37:44,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:44,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:45,767 INFO L134 CoverageAnalysis]: Checked inductivity of 810 backedges. 420 proven. 9 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-10-10 22:37:45,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:45,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145790751] [2024-10-10 22:37:45,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145790751] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:45,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727925454] [2024-10-10 22:37:45,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:45,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:45,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:45,772 INFO L229 MonitoredProcess]: Starting monitored process 8 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 22:37:45,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-10 22:37:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:46,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:37:46,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:46,125 INFO L134 CoverageAnalysis]: Checked inductivity of 810 backedges. 660 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-10 22:37:46,126 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:46,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727925454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:46,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:46,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 22:37:46,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203578913] [2024-10-10 22:37:46,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:46,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:46,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:46,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:46,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:37:46,129 INFO L87 Difference]: Start difference. First operand 135871 states and 144564 transitions. Second operand has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:47,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:47,254 INFO L93 Difference]: Finished difference Result 354054 states and 377639 transitions. [2024-10-10 22:37:47,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:47,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 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 570 [2024-10-10 22:37:47,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:47,601 INFO L225 Difference]: With dead ends: 354054 [2024-10-10 22:37:47,601 INFO L226 Difference]: Without dead ends: 223064 [2024-10-10 22:37:47,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 569 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:37:47,716 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 160 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:47,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 754 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:37:47,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223064 states. [2024-10-10 22:37:50,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223064 to 218594. [2024-10-10 22:37:50,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218594 states, 218593 states have (on average 1.0600476684980764) internal successors, (231719), 218593 states have internal predecessors, (231719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218594 states to 218594 states and 231719 transitions. [2024-10-10 22:37:50,980 INFO L78 Accepts]: Start accepts. Automaton has 218594 states and 231719 transitions. Word has length 570 [2024-10-10 22:37:50,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:50,981 INFO L471 AbstractCegarLoop]: Abstraction has 218594 states and 231719 transitions. [2024-10-10 22:37:50,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:50,981 INFO L276 IsEmpty]: Start isEmpty. Operand 218594 states and 231719 transitions. [2024-10-10 22:37:51,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2024-10-10 22:37:51,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:51,098 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2024-10-10 22:37:51,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-10 22:37:51,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:51,301 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:51,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:51,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1846563609, now seen corresponding path program 1 times [2024-10-10 22:37:51,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:51,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940012379] [2024-10-10 22:37:51,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:51,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:52,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 451 proven. 9 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-10 22:37:52,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:37:52,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940012379] [2024-10-10 22:37:52,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940012379] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:37:52,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316893885] [2024-10-10 22:37:52,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:52,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:37:52,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:37:52,733 INFO L229 MonitoredProcess]: Starting monitored process 9 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 22:37:52,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-10 22:37:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:37:53,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:37:53,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:37:53,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 592 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2024-10-10 22:37:53,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:37:53,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316893885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:37:53,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:37:53,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 22:37:53,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51537424] [2024-10-10 22:37:53,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:37:53,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:37:53,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:37:53,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:37:53,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:37:53,093 INFO L87 Difference]: Start difference. First operand 218594 states and 231719 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:37:54,623 INFO L93 Difference]: Finished difference Result 421134 states and 446343 transitions. [2024-10-10 22:37:54,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:37:54,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 581 [2024-10-10 22:37:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:37:54,912 INFO L225 Difference]: With dead ends: 421134 [2024-10-10 22:37:54,912 INFO L226 Difference]: Without dead ends: 204370 [2024-10-10 22:37:55,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 580 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:37:55,068 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 221 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:37:55,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 82 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:37:55,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204370 states. [2024-10-10 22:37:57,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204370 to 189330. [2024-10-10 22:37:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189330 states, 189329 states have (on average 1.050335659090789) internal successors, (198859), 189329 states have internal predecessors, (198859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:58,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189330 states to 189330 states and 198859 transitions. [2024-10-10 22:37:58,280 INFO L78 Accepts]: Start accepts. Automaton has 189330 states and 198859 transitions. Word has length 581 [2024-10-10 22:37:58,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:37:58,280 INFO L471 AbstractCegarLoop]: Abstraction has 189330 states and 198859 transitions. [2024-10-10 22:37:58,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:37:58,281 INFO L276 IsEmpty]: Start isEmpty. Operand 189330 states and 198859 transitions. [2024-10-10 22:37:58,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2024-10-10 22:37:58,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:37:58,402 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:58,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-10 22:37:58,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-10 22:37:58,605 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:37:58,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:37:58,605 INFO L85 PathProgramCache]: Analyzing trace with hash -360115598, now seen corresponding path program 1 times [2024-10-10 22:37:58,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:37:58,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979239659] [2024-10-10 22:37:58,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:37:58,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:37:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:01,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 708 proven. 166 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2024-10-10 22:38:01,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:38:01,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979239659] [2024-10-10 22:38:01,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979239659] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:38:01,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744961088] [2024-10-10 22:38:01,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:38:01,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:38:01,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:38:01,538 INFO L229 MonitoredProcess]: Starting monitored process 10 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 22:38:01,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-10 22:38:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:38:01,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 1006 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:38:01,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:38:02,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2024-10-10 22:38:02,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:38:02,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2024-10-10 22:38:02,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744961088] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:38:02,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:38:02,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3, 3] total 10 [2024-10-10 22:38:02,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667701390] [2024-10-10 22:38:02,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:38:02,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-10 22:38:02,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:38:02,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-10 22:38:02,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-10 22:38:02,803 INFO L87 Difference]: Start difference. First operand 189330 states and 198859 transitions. Second operand has 11 states, 11 states have (on average 69.36363636363636) internal successors, (763), 10 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:38:08,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:38:08,967 INFO L93 Difference]: Finished difference Result 603382 states and 635548 transitions. [2024-10-10 22:38:08,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-10 22:38:08,967 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 69.36363636363636) internal successors, (763), 10 states have internal predecessors, (763), 0 states have call successors, (0), 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 603 [2024-10-10 22:38:08,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:38:09,708 INFO L225 Difference]: With dead ends: 603382 [2024-10-10 22:38:09,708 INFO L226 Difference]: Without dead ends: 415882 [2024-10-10 22:38:09,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1224 GetRequests, 1203 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2024-10-10 22:38:09,903 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 3159 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 6925 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3159 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 7437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 6925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:38:09,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3159 Valid, 358 Invalid, 7437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 6925 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-10 22:38:10,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415882 states.