./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_label38.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label38.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d6ab095cb4c47e2e0ab83610e7dceb2c658ebc8f7a2b4be1c26690c64da4af60 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:19:40,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:19:40,371 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:19:40,377 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:19:40,377 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:19:40,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:19:40,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:19:40,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:19:40,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:19:40,409 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:19:40,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:19:40,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:19:40,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:19:40,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:19:40,413 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:19:40,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:19:40,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:19:40,414 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:19:40,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:19:40,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:19:40,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:19:40,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:19:40,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:19:40,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:19:40,420 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:19:40,420 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:19:40,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:19:40,420 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:19:40,421 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:19:40,421 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:19:40,421 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:19:40,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:19:40,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:19:40,422 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:19:40,422 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:19:40,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:19:40,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:19:40,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:19:40,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:19:40,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:19:40,425 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:19:40,425 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:19:40,426 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/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/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 -> d6ab095cb4c47e2e0ab83610e7dceb2c658ebc8f7a2b4be1c26690c64da4af60 [2024-10-12 15:19:40,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:19:40,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:19:40,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:19:40,694 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:19:40,695 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:19:40,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label38.c [2024-10-12 15:19:42,132 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:19:42,441 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:19:42,444 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label38.c [2024-10-12 15:19:42,469 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e232b2a21/614b5691b06747b7a66a7f9ec8e6d288/FLAG5187baa55 [2024-10-12 15:19:42,696 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e232b2a21/614b5691b06747b7a66a7f9ec8e6d288 [2024-10-12 15:19:42,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:19:42,699 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:19:42,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:19:42,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:19:42,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:19:42,707 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:19:42" (1/1) ... [2024-10-12 15:19:42,710 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c69aff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:42, skipping insertion in model container [2024-10-12 15:19:42,710 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:19:42" (1/1) ... [2024-10-12 15:19:42,778 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:19:43,300 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_label38.c[61364,61377] [2024-10-12 15:19:43,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:19:43,342 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:19:43,618 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_label38.c[61364,61377] [2024-10-12 15:19:43,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:19:43,647 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:19:43,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:43 WrapperNode [2024-10-12 15:19:43,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:19:43,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:19:43,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:19:43,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:19:43,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:43" (1/1) ... [2024-10-12 15:19:43,701 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:43" (1/1) ... [2024-10-12 15:19:43,793 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-10-12 15:19:43,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:19:43,794 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:19:43,794 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:19:43,794 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:19:43,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:43" (1/1) ... [2024-10-12 15:19:43,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:43" (1/1) ... [2024-10-12 15:19:43,817 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:43" (1/1) ... [2024-10-12 15:19:43,856 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-12 15:19:43,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:43" (1/1) ... [2024-10-12 15:19:43,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:43" (1/1) ... [2024-10-12 15:19:43,892 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:43" (1/1) ... [2024-10-12 15:19:43,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:43" (1/1) ... [2024-10-12 15:19:43,921 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:43" (1/1) ... [2024-10-12 15:19:43,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:43" (1/1) ... [2024-10-12 15:19:43,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:19:43,956 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:19:43,956 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:19:43,957 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:19:43,958 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:43" (1/1) ... [2024-10-12 15:19:43,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:19:43,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:19:43,992 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 15:19:43,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 15:19:44,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:19:44,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:19:44,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:19:44,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:19:44,116 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:19:44,118 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:19:45,794 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-12 15:19:45,794 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:19:45,851 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:19:45,851 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:19:45,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:19:45 BoogieIcfgContainer [2024-10-12 15:19:45,852 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:19:45,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:19:45,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:19:45,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:19:45,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:19:42" (1/3) ... [2024-10-12 15:19:45,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d9cb9e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:19:45, skipping insertion in model container [2024-10-12 15:19:45,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:19:43" (2/3) ... [2024-10-12 15:19:45,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d9cb9e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:19:45, skipping insertion in model container [2024-10-12 15:19:45,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:19:45" (3/3) ... [2024-10-12 15:19:45,861 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label38.c [2024-10-12 15:19:45,878 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:19:45,878 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:19:45,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:19:45,961 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;@5b5d211b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:19:45,961 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:19:45,967 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-12 15:19:45,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-12 15:19:45,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:45,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:45,987 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:45,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:45,992 INFO L85 PathProgramCache]: Analyzing trace with hash -897072396, now seen corresponding path program 1 times [2024-10-12 15:19:46,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:46,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6768523] [2024-10-12 15:19:46,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:46,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:46,614 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-12 15:19:46,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:46,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6768523] [2024-10-12 15:19:46,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6768523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:46,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:46,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:46,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092541904] [2024-10-12 15:19:46,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:46,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:19:46,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:46,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:19:46,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:19:46,651 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 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:46,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:46,709 INFO L93 Difference]: Finished difference Result 479 states and 913 transitions. [2024-10-12 15:19:46,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:19:46,715 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2024-10-12 15:19:46,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:46,731 INFO L225 Difference]: With dead ends: 479 [2024-10-12 15:19:46,731 INFO L226 Difference]: Without dead ends: 238 [2024-10-12 15:19:46,735 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-12 15:19:46,740 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-12 15:19:46,741 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-12 15:19:46,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-12 15:19:46,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-12 15:19:46,793 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-12 15:19:46,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2024-10-12 15:19:46,797 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 200 [2024-10-12 15:19:46,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:46,800 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2024-10-12 15:19:46,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:46,801 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2024-10-12 15:19:46,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-12 15:19:46,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:46,803 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:46,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:19:46,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:46,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:46,806 INFO L85 PathProgramCache]: Analyzing trace with hash 840374366, now seen corresponding path program 1 times [2024-10-12 15:19:46,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:46,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705974623] [2024-10-12 15:19:46,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:46,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:47,366 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-12 15:19:47,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:47,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705974623] [2024-10-12 15:19:47,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705974623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:47,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:47,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:47,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660025587] [2024-10-12 15:19:47,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:47,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:47,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:47,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:47,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:47,375 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:48,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:48,310 INFO L93 Difference]: Finished difference Result 698 states and 1151 transitions. [2024-10-12 15:19:48,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:48,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2024-10-12 15:19:48,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:48,321 INFO L225 Difference]: With dead ends: 698 [2024-10-12 15:19:48,324 INFO L226 Difference]: Without dead ends: 461 [2024-10-12 15:19:48,325 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-12 15:19:48,326 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 55 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:48,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 148 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 15:19:48,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-10-12 15:19:48,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 459. [2024-10-12 15:19:48,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.539301310043668) internal successors, (705), 458 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:48,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 705 transitions. [2024-10-12 15:19:48,354 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 705 transitions. Word has length 200 [2024-10-12 15:19:48,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:48,354 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 705 transitions. [2024-10-12 15:19:48,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:48,355 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 705 transitions. [2024-10-12 15:19:48,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-12 15:19:48,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:48,359 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:48,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:19:48,360 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:48,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:48,360 INFO L85 PathProgramCache]: Analyzing trace with hash 30681759, now seen corresponding path program 1 times [2024-10-12 15:19:48,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:48,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342931421] [2024-10-12 15:19:48,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:48,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:19:48,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:48,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342931421] [2024-10-12 15:19:48,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342931421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:48,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:48,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:48,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666047844] [2024-10-12 15:19:48,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:48,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:48,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:48,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:48,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:48,652 INFO L87 Difference]: Start difference. First operand 459 states and 705 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-12 15:19:49,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:49,500 INFO L93 Difference]: Finished difference Result 1343 states and 2078 transitions. [2024-10-12 15:19:49,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:49,500 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 208 [2024-10-12 15:19:49,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:49,504 INFO L225 Difference]: With dead ends: 1343 [2024-10-12 15:19:49,504 INFO L226 Difference]: Without dead ends: 885 [2024-10-12 15:19:49,505 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-12 15:19:49,506 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:49,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 90 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:19:49,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-10-12 15:19:49,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 869. [2024-10-12 15:19:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.512672811059908) internal successors, (1313), 868 states have internal predecessors, (1313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:49,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1313 transitions. [2024-10-12 15:19:49,537 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1313 transitions. Word has length 208 [2024-10-12 15:19:49,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:49,538 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1313 transitions. [2024-10-12 15:19:49,538 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-12 15:19:49,538 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1313 transitions. [2024-10-12 15:19:49,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-12 15:19:49,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:49,544 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:19:49,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:19:49,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:49,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:49,546 INFO L85 PathProgramCache]: Analyzing trace with hash 588149208, now seen corresponding path program 1 times [2024-10-12 15:19:49,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:49,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665007888] [2024-10-12 15:19:49,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:49,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:49,962 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:19:49,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:49,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665007888] [2024-10-12 15:19:49,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665007888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:49,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:49,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:19:49,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322886996] [2024-10-12 15:19:49,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:49,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:49,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:49,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:49,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:49,967 INFO L87 Difference]: Start difference. First operand 869 states and 1313 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) 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-12 15:19:50,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:50,776 INFO L93 Difference]: Finished difference Result 2553 states and 3868 transitions. [2024-10-12 15:19:50,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:50,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) 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 220 [2024-10-12 15:19:50,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:50,783 INFO L225 Difference]: With dead ends: 2553 [2024-10-12 15:19:50,783 INFO L226 Difference]: Without dead ends: 1685 [2024-10-12 15:19:50,785 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-12 15:19:50,786 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 232 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:50,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 414 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:19:50,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2024-10-12 15:19:50,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1683. [2024-10-12 15:19:50,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1682 states have (on average 1.3365041617122473) internal successors, (2248), 1682 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2248 transitions. [2024-10-12 15:19:50,824 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2248 transitions. Word has length 220 [2024-10-12 15:19:50,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:50,825 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2248 transitions. [2024-10-12 15:19:50,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) 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-12 15:19:50,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2248 transitions. [2024-10-12 15:19:50,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-12 15:19:50,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:50,835 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:19:50,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:19:50,836 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:50,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:50,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1422248459, now seen corresponding path program 1 times [2024-10-12 15:19:50,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:50,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101575164] [2024-10-12 15:19:50,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:50,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:51,172 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:19:51,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:51,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101575164] [2024-10-12 15:19:51,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101575164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:51,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:51,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:51,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767462855] [2024-10-12 15:19:51,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:51,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:51,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:51,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:51,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:51,175 INFO L87 Difference]: Start difference. First operand 1683 states and 2248 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:51,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:51,915 INFO L93 Difference]: Finished difference Result 5016 states and 6706 transitions. [2024-10-12 15:19:51,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:51,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 223 [2024-10-12 15:19:51,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:51,929 INFO L225 Difference]: With dead ends: 5016 [2024-10-12 15:19:51,930 INFO L226 Difference]: Without dead ends: 3334 [2024-10-12 15:19:51,933 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-12 15:19:51,935 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 259 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:51,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 121 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:19:51,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2024-10-12 15:19:51,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 3325. [2024-10-12 15:19:51,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3325 states, 3324 states have (on average 1.3231046931407942) internal successors, (4398), 3324 states have internal predecessors, (4398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3325 states to 3325 states and 4398 transitions. [2024-10-12 15:19:52,001 INFO L78 Accepts]: Start accepts. Automaton has 3325 states and 4398 transitions. Word has length 223 [2024-10-12 15:19:52,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:52,003 INFO L471 AbstractCegarLoop]: Abstraction has 3325 states and 4398 transitions. [2024-10-12 15:19:52,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:52,004 INFO L276 IsEmpty]: Start isEmpty. Operand 3325 states and 4398 transitions. [2024-10-12 15:19:52,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-10-12 15:19:52,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:52,012 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:19:52,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:19:52,013 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:52,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:52,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1749045427, now seen corresponding path program 1 times [2024-10-12 15:19:52,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:52,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919865014] [2024-10-12 15:19:52,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:52,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:52,310 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:19:52,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:52,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919865014] [2024-10-12 15:19:52,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919865014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:52,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:52,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:52,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290882143] [2024-10-12 15:19:52,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:52,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:52,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:52,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:52,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:52,314 INFO L87 Difference]: Start difference. First operand 3325 states and 4398 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 2 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:53,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:53,064 INFO L93 Difference]: Finished difference Result 9927 states and 13144 transitions. [2024-10-12 15:19:53,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:53,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 2 states have internal predecessors, (226), 0 states have call successors, (0), 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 226 [2024-10-12 15:19:53,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:53,091 INFO L225 Difference]: With dead ends: 9927 [2024-10-12 15:19:53,092 INFO L226 Difference]: Without dead ends: 6603 [2024-10-12 15:19:53,099 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-12 15:19:53,101 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 219 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:53,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 165 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:19:53,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6603 states. [2024-10-12 15:19:53,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6603 to 5767. [2024-10-12 15:19:53,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5767 states, 5766 states have (on average 1.3371488033298646) internal successors, (7710), 5766 states have internal predecessors, (7710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:53,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 7710 transitions. [2024-10-12 15:19:53,300 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 7710 transitions. Word has length 226 [2024-10-12 15:19:53,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:53,304 INFO L471 AbstractCegarLoop]: Abstraction has 5767 states and 7710 transitions. [2024-10-12 15:19:53,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 2 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:53,304 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 7710 transitions. [2024-10-12 15:19:53,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-10-12 15:19:53,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:53,318 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:53,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:19:53,319 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:53,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:53,319 INFO L85 PathProgramCache]: Analyzing trace with hash 520275530, now seen corresponding path program 1 times [2024-10-12 15:19:53,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:53,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917705424] [2024-10-12 15:19:53,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:53,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:53,664 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:19:53,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:53,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917705424] [2024-10-12 15:19:53,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917705424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:53,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:53,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:19:53,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749963047] [2024-10-12 15:19:53,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:53,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:53,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:53,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:53,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:53,667 INFO L87 Difference]: Start difference. First operand 5767 states and 7710 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:54,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:54,610 INFO L93 Difference]: Finished difference Result 14590 states and 19419 transitions. [2024-10-12 15:19:54,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:54,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 235 [2024-10-12 15:19:54,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:54,641 INFO L225 Difference]: With dead ends: 14590 [2024-10-12 15:19:54,641 INFO L226 Difference]: Without dead ends: 8824 [2024-10-12 15:19:54,650 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-12 15:19:54,652 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 202 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:54,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 418 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:19:54,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8824 states. [2024-10-12 15:19:54,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8824 to 8820. [2024-10-12 15:19:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8820 states, 8819 states have (on average 1.2787164077559814) internal successors, (11277), 8819 states have internal predecessors, (11277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8820 states to 8820 states and 11277 transitions. [2024-10-12 15:19:54,807 INFO L78 Accepts]: Start accepts. Automaton has 8820 states and 11277 transitions. Word has length 235 [2024-10-12 15:19:54,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:54,808 INFO L471 AbstractCegarLoop]: Abstraction has 8820 states and 11277 transitions. [2024-10-12 15:19:54,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:54,808 INFO L276 IsEmpty]: Start isEmpty. Operand 8820 states and 11277 transitions. [2024-10-12 15:19:54,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-10-12 15:19:54,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:54,825 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:19:54,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:19:54,826 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:54,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:54,826 INFO L85 PathProgramCache]: Analyzing trace with hash -470736308, now seen corresponding path program 1 times [2024-10-12 15:19:54,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:54,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933477943] [2024-10-12 15:19:54,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:54,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:55,290 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:19:55,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:55,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933477943] [2024-10-12 15:19:55,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933477943] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:19:55,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262795922] [2024-10-12 15:19:55,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:55,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:19:55,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:19:55,295 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:19:55,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 15:19:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:55,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:19:55,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:19:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:19:55,579 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:19:55,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262795922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:55,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:19:55,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-12 15:19:55,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732548759] [2024-10-12 15:19:55,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:55,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:55,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:55,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:55,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:19:55,585 INFO L87 Difference]: Start difference. First operand 8820 states and 11277 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 2 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:56,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:56,454 INFO L93 Difference]: Finished difference Result 25784 states and 33054 transitions. [2024-10-12 15:19:56,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:56,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 2 states have internal predecessors, (232), 0 states have call successors, (0), 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 237 [2024-10-12 15:19:56,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:56,507 INFO L225 Difference]: With dead ends: 25784 [2024-10-12 15:19:56,507 INFO L226 Difference]: Without dead ends: 16965 [2024-10-12 15:19:56,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 236 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-12 15:19:56,521 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 230 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:56,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 166 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:19:56,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16965 states. [2024-10-12 15:19:56,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16965 to 16558. [2024-10-12 15:19:56,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16558 states, 16557 states have (on average 1.2508304644561212) internal successors, (20710), 16557 states have internal predecessors, (20710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:56,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16558 states to 16558 states and 20710 transitions. [2024-10-12 15:19:56,806 INFO L78 Accepts]: Start accepts. Automaton has 16558 states and 20710 transitions. Word has length 237 [2024-10-12 15:19:56,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:56,806 INFO L471 AbstractCegarLoop]: Abstraction has 16558 states and 20710 transitions. [2024-10-12 15:19:56,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 2 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:56,806 INFO L276 IsEmpty]: Start isEmpty. Operand 16558 states and 20710 transitions. [2024-10-12 15:19:56,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-12 15:19:56,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:56,834 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:19:56,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 15:19:57,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:19:57,035 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:57,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:57,036 INFO L85 PathProgramCache]: Analyzing trace with hash -804536183, now seen corresponding path program 1 times [2024-10-12 15:19:57,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:57,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721804076] [2024-10-12 15:19:57,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:57,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:57,714 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:19:57,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:57,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721804076] [2024-10-12 15:19:57,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721804076] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:57,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:57,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:57,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483404558] [2024-10-12 15:19:57,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:57,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:57,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:57,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:57,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:57,716 INFO L87 Difference]: Start difference. First operand 16558 states and 20710 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 2 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:58,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:58,656 INFO L93 Difference]: Finished difference Result 38427 states and 47957 transitions. [2024-10-12 15:19:58,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:58,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 2 states have internal predecessors, (241), 0 states have call successors, (0), 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-12 15:19:58,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:58,699 INFO L225 Difference]: With dead ends: 38427 [2024-10-12 15:19:58,700 INFO L226 Difference]: Without dead ends: 21870 [2024-10-12 15:19:58,715 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-12 15:19:58,716 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 197 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:58,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 193 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:19:58,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21870 states. [2024-10-12 15:19:58,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21870 to 21856. [2024-10-12 15:19:58,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21856 states, 21855 states have (on average 1.2372912377030427) internal successors, (27041), 21855 states have internal predecessors, (27041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:59,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21856 states to 21856 states and 27041 transitions. [2024-10-12 15:19:59,001 INFO L78 Accepts]: Start accepts. Automaton has 21856 states and 27041 transitions. Word has length 241 [2024-10-12 15:19:59,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:59,001 INFO L471 AbstractCegarLoop]: Abstraction has 21856 states and 27041 transitions. [2024-10-12 15:19:59,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 2 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:19:59,002 INFO L276 IsEmpty]: Start isEmpty. Operand 21856 states and 27041 transitions. [2024-10-12 15:19:59,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-12 15:19:59,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:59,030 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:19:59,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 15:19:59,031 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:59,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:59,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1838501018, now seen corresponding path program 1 times [2024-10-12 15:19:59,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:59,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514503385] [2024-10-12 15:19:59,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:59,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:59,613 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:19:59,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:59,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514503385] [2024-10-12 15:19:59,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514503385] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:19:59,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800946945] [2024-10-12 15:19:59,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:59,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:19:59,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:19:59,617 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:19:59,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 15:19:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:59,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:19:59,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:00,058 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:20:00,058 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:00,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800946945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:00,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:00,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:20:00,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684897776] [2024-10-12 15:20:00,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:00,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:00,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:00,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:00,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:00,060 INFO L87 Difference]: Start difference. First operand 21856 states and 27041 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:00,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:00,889 INFO L93 Difference]: Finished difference Result 50636 states and 63476 transitions. [2024-10-12 15:20:00,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:00,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 248 [2024-10-12 15:20:00,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:00,936 INFO L225 Difference]: With dead ends: 50636 [2024-10-12 15:20:00,936 INFO L226 Difference]: Without dead ends: 29390 [2024-10-12 15:20:00,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 247 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-12 15:20:00,955 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 52 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:00,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 395 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:20:00,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29390 states. [2024-10-12 15:20:01,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29390 to 29377. [2024-10-12 15:20:01,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29377 states, 29376 states have (on average 1.2390046296296295) internal successors, (36397), 29376 states have internal predecessors, (36397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29377 states to 29377 states and 36397 transitions. [2024-10-12 15:20:01,295 INFO L78 Accepts]: Start accepts. Automaton has 29377 states and 36397 transitions. Word has length 248 [2024-10-12 15:20:01,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:01,296 INFO L471 AbstractCegarLoop]: Abstraction has 29377 states and 36397 transitions. [2024-10-12 15:20:01,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:01,296 INFO L276 IsEmpty]: Start isEmpty. Operand 29377 states and 36397 transitions. [2024-10-12 15:20:01,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-10-12 15:20:01,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:01,331 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 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-12 15:20:01,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 15:20:01,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-12 15:20:01,532 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:01,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:01,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1325453329, now seen corresponding path program 1 times [2024-10-12 15:20:01,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:01,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576311622] [2024-10-12 15:20:01,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:01,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:02,206 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 72 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-12 15:20:02,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:02,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576311622] [2024-10-12 15:20:02,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576311622] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:02,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371886844] [2024-10-12 15:20:02,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:02,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:02,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:02,209 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:20:02,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 15:20:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:02,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:20:02,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:02,463 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:20:02,463 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:02,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371886844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:02,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:02,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:20:02,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811321088] [2024-10-12 15:20:02,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:02,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:02,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:02,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:02,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:02,467 INFO L87 Difference]: Start difference. First operand 29377 states and 36397 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:03,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:03,358 INFO L93 Difference]: Finished difference Result 70327 states and 88562 transitions. [2024-10-12 15:20:03,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:03,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 267 [2024-10-12 15:20:03,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:03,427 INFO L225 Difference]: With dead ends: 70327 [2024-10-12 15:20:03,428 INFO L226 Difference]: Without dead ends: 41154 [2024-10-12 15:20:03,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:03,458 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 223 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:03,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 170 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:20:03,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41154 states. [2024-10-12 15:20:03,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41154 to 40745. [2024-10-12 15:20:03,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40745 states, 40744 states have (on average 1.2023856273316316) internal successors, (48990), 40744 states have internal predecessors, (48990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:04,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40745 states to 40745 states and 48990 transitions. [2024-10-12 15:20:04,033 INFO L78 Accepts]: Start accepts. Automaton has 40745 states and 48990 transitions. Word has length 267 [2024-10-12 15:20:04,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:04,034 INFO L471 AbstractCegarLoop]: Abstraction has 40745 states and 48990 transitions. [2024-10-12 15:20:04,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:04,034 INFO L276 IsEmpty]: Start isEmpty. Operand 40745 states and 48990 transitions. [2024-10-12 15:20:04,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-10-12 15:20:04,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:04,061 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:20:04,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 15:20:04,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:04,262 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:04,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:04,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1057820554, now seen corresponding path program 1 times [2024-10-12 15:20:04,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:04,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773402112] [2024-10-12 15:20:04,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:04,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:04,844 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-12 15:20:04,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:04,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773402112] [2024-10-12 15:20:04,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773402112] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:04,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379908977] [2024-10-12 15:20:04,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:04,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:04,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:04,847 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:20:04,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 15:20:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:04,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:20:04,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:05,035 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:20:05,035 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:05,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379908977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:05,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:05,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:20:05,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356055364] [2024-10-12 15:20:05,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:05,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:05,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:05,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:05,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:05,037 INFO L87 Difference]: Start difference. First operand 40745 states and 48990 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:05,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:05,740 INFO L93 Difference]: Finished difference Result 81289 states and 97760 transitions. [2024-10-12 15:20:05,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:05,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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 268 [2024-10-12 15:20:05,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:05,792 INFO L225 Difference]: With dead ends: 81289 [2024-10-12 15:20:05,792 INFO L226 Difference]: Without dead ends: 40748 [2024-10-12 15:20:05,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 267 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-12 15:20:05,830 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 259 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:05,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 95 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:20:05,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40748 states. [2024-10-12 15:20:06,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40748 to 40745. [2024-10-12 15:20:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40745 states, 40744 states have (on average 1.190113881798547) internal successors, (48490), 40744 states have internal predecessors, (48490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:06,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40745 states to 40745 states and 48490 transitions. [2024-10-12 15:20:06,433 INFO L78 Accepts]: Start accepts. Automaton has 40745 states and 48490 transitions. Word has length 268 [2024-10-12 15:20:06,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:06,434 INFO L471 AbstractCegarLoop]: Abstraction has 40745 states and 48490 transitions. [2024-10-12 15:20:06,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:06,434 INFO L276 IsEmpty]: Start isEmpty. Operand 40745 states and 48490 transitions. [2024-10-12 15:20:06,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-10-12 15:20:06,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:06,473 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1] [2024-10-12 15:20:06,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 15:20:06,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:06,674 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:06,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:06,675 INFO L85 PathProgramCache]: Analyzing trace with hash -603815605, now seen corresponding path program 1 times [2024-10-12 15:20:06,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:06,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829392829] [2024-10-12 15:20:06,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:06,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-12 15:20:06,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:06,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829392829] [2024-10-12 15:20:06,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829392829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:06,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:06,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:20:06,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028281769] [2024-10-12 15:20:06,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:06,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:06,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:06,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:06,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:20:06,960 INFO L87 Difference]: Start difference. First operand 40745 states and 48490 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:07,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:07,847 INFO L93 Difference]: Finished difference Result 87198 states and 103811 transitions. [2024-10-12 15:20:07,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:07,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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-12 15:20:07,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:07,903 INFO L225 Difference]: With dead ends: 87198 [2024-10-12 15:20:07,903 INFO L226 Difference]: Without dead ends: 46657 [2024-10-12 15:20:07,935 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-12 15:20:07,936 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 214 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:07,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 378 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:20:08,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46657 states. [2024-10-12 15:20:08,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46657 to 39319. [2024-10-12 15:20:08,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39319 states, 39318 states have (on average 1.188107228241518) internal successors, (46714), 39318 states have internal predecessors, (46714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:08,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39319 states to 39319 states and 46714 transitions. [2024-10-12 15:20:08,708 INFO L78 Accepts]: Start accepts. Automaton has 39319 states and 46714 transitions. Word has length 271 [2024-10-12 15:20:08,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:08,709 INFO L471 AbstractCegarLoop]: Abstraction has 39319 states and 46714 transitions. [2024-10-12 15:20:08,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:08,709 INFO L276 IsEmpty]: Start isEmpty. Operand 39319 states and 46714 transitions. [2024-10-12 15:20:08,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-10-12 15:20:08,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:08,751 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:20:08,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 15:20:08,751 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:08,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:08,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1224538522, now seen corresponding path program 1 times [2024-10-12 15:20:08,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:08,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821640457] [2024-10-12 15:20:08,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:08,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-12 15:20:09,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:09,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821640457] [2024-10-12 15:20:09,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821640457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:09,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:09,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:20:09,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961868463] [2024-10-12 15:20:09,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:09,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:20:09,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:09,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:20:09,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:20:09,198 INFO L87 Difference]: Start difference. First operand 39319 states and 46714 transitions. Second operand has 4 states, 4 states have (on average 62.0) 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-12 15:20:10,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:10,406 INFO L93 Difference]: Finished difference Result 78676 states and 93502 transitions. [2024-10-12 15:20:10,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:20:10,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.0) 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 287 [2024-10-12 15:20:10,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:10,450 INFO L225 Difference]: With dead ends: 78676 [2024-10-12 15:20:10,451 INFO L226 Difference]: Without dead ends: 39561 [2024-10-12 15:20:10,464 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-12 15:20:10,465 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 445 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:10,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 164 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 15:20:10,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39561 states. [2024-10-12 15:20:10,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39561 to 38099. [2024-10-12 15:20:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38099 states, 38098 states have (on average 1.1901674628589427) internal successors, (45343), 38098 states have internal predecessors, (45343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38099 states to 38099 states and 45343 transitions. [2024-10-12 15:20:10,959 INFO L78 Accepts]: Start accepts. Automaton has 38099 states and 45343 transitions. Word has length 287 [2024-10-12 15:20:10,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:10,960 INFO L471 AbstractCegarLoop]: Abstraction has 38099 states and 45343 transitions. [2024-10-12 15:20:10,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) 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-12 15:20:10,960 INFO L276 IsEmpty]: Start isEmpty. Operand 38099 states and 45343 transitions. [2024-10-12 15:20:10,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-10-12 15:20:10,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:10,992 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:20:10,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 15:20:10,992 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:10,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:10,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1312668582, now seen corresponding path program 1 times [2024-10-12 15:20:10,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:10,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293911295] [2024-10-12 15:20:10,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:10,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-12 15:20:12,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:12,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293911295] [2024-10-12 15:20:12,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293911295] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:12,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901671540] [2024-10-12 15:20:12,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:12,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:12,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:12,191 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:20:12,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 15:20:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:12,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:20:12,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:12,375 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 15:20:12,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:12,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901671540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:12,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:12,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 15:20:12,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610644787] [2024-10-12 15:20:12,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:12,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:12,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:12,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:12,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:20:12,377 INFO L87 Difference]: Start difference. First operand 38099 states and 45343 transitions. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:13,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:13,096 INFO L93 Difference]: Finished difference Result 75388 states and 89772 transitions. [2024-10-12 15:20:13,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:13,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 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 293 [2024-10-12 15:20:13,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:13,134 INFO L225 Difference]: With dead ends: 75388 [2024-10-12 15:20:13,134 INFO L226 Difference]: Without dead ends: 37493 [2024-10-12 15:20:13,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:20:13,159 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 261 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:13,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 339 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:20:13,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37493 states. [2024-10-12 15:20:13,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37493 to 37490. [2024-10-12 15:20:13,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37490 states, 37489 states have (on average 1.1819733788577982) internal successors, (44311), 37489 states have internal predecessors, (44311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:13,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37490 states to 37490 states and 44311 transitions. [2024-10-12 15:20:13,559 INFO L78 Accepts]: Start accepts. Automaton has 37490 states and 44311 transitions. Word has length 293 [2024-10-12 15:20:13,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:13,559 INFO L471 AbstractCegarLoop]: Abstraction has 37490 states and 44311 transitions. [2024-10-12 15:20:13,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 37490 states and 44311 transitions. [2024-10-12 15:20:13,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2024-10-12 15:20:13,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:13,705 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:20:13,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 15:20:13,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-12 15:20:13,906 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:13,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:13,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1496048457, now seen corresponding path program 1 times [2024-10-12 15:20:13,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:13,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64777905] [2024-10-12 15:20:13,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:13,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-12 15:20:14,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:14,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64777905] [2024-10-12 15:20:14,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64777905] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:14,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806757158] [2024-10-12 15:20:14,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:14,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:14,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:14,308 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:20:14,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 15:20:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:14,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:20:14,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:14,532 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-12 15:20:14,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:14,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806757158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:14,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:14,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:20:14,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600249753] [2024-10-12 15:20:14,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:14,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:14,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:14,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:14,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:14,534 INFO L87 Difference]: Start difference. First operand 37490 states and 44311 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:15,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:15,337 INFO L93 Difference]: Finished difference Result 73789 states and 87097 transitions. [2024-10-12 15:20:15,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:15,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 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 294 [2024-10-12 15:20:15,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:15,379 INFO L225 Difference]: With dead ends: 73789 [2024-10-12 15:20:15,379 INFO L226 Difference]: Without dead ends: 36503 [2024-10-12 15:20:15,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 293 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-12 15:20:15,403 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 214 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:15,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 377 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:20:15,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36503 states. [2024-10-12 15:20:15,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36503 to 36475. [2024-10-12 15:20:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36475 states, 36474 states have (on average 1.1703130997422821) internal successors, (42686), 36474 states have internal predecessors, (42686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:15,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36475 states to 36475 states and 42686 transitions. [2024-10-12 15:20:15,861 INFO L78 Accepts]: Start accepts. Automaton has 36475 states and 42686 transitions. Word has length 294 [2024-10-12 15:20:15,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:15,861 INFO L471 AbstractCegarLoop]: Abstraction has 36475 states and 42686 transitions. [2024-10-12 15:20:15,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:15,862 INFO L276 IsEmpty]: Start isEmpty. Operand 36475 states and 42686 transitions. [2024-10-12 15:20:15,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-10-12 15:20:15,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:15,884 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:20:15,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-12 15:20:16,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-12 15:20:16,085 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:16,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:16,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1834471820, now seen corresponding path program 1 times [2024-10-12 15:20:16,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:16,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865016156] [2024-10-12 15:20:16,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:16,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-12 15:20:17,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:17,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865016156] [2024-10-12 15:20:17,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865016156] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:17,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079295842] [2024-10-12 15:20:17,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:17,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:17,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:17,361 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:20:17,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 15:20:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:17,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:20:17,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:17,570 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:20:17,570 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:17,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079295842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:17,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:17,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 15:20:17,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190845444] [2024-10-12 15:20:17,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:17,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:17,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:17,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:17,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:20:17,573 INFO L87 Difference]: Start difference. First operand 36475 states and 42686 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:18,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:18,331 INFO L93 Difference]: Finished difference Result 70700 states and 82459 transitions. [2024-10-12 15:20:18,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:18,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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 299 [2024-10-12 15:20:18,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:18,368 INFO L225 Difference]: With dead ends: 70700 [2024-10-12 15:20:18,368 INFO L226 Difference]: Without dead ends: 34429 [2024-10-12 15:20:18,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:20:18,395 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 258 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:18,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 375 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:20:18,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34429 states. [2024-10-12 15:20:18,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34429 to 32193. [2024-10-12 15:20:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32193 states, 32192 states have (on average 1.1408113817097416) internal successors, (36725), 32192 states have internal predecessors, (36725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:18,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32193 states to 32193 states and 36725 transitions. [2024-10-12 15:20:18,758 INFO L78 Accepts]: Start accepts. Automaton has 32193 states and 36725 transitions. Word has length 299 [2024-10-12 15:20:18,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:18,759 INFO L471 AbstractCegarLoop]: Abstraction has 32193 states and 36725 transitions. [2024-10-12 15:20:18,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:18,759 INFO L276 IsEmpty]: Start isEmpty. Operand 32193 states and 36725 transitions. [2024-10-12 15:20:18,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-10-12 15:20:18,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:18,785 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:20:18,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-12 15:20:18,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:18,986 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:18,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:18,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1161446318, now seen corresponding path program 1 times [2024-10-12 15:20:18,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:18,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174594426] [2024-10-12 15:20:18,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:18,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:19,329 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 146 proven. 6 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-10-12 15:20:19,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:19,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174594426] [2024-10-12 15:20:19,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174594426] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:19,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651021121] [2024-10-12 15:20:19,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:19,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:19,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:19,333 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:20:19,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-12 15:20:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:19,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:20:19,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:19,579 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-10-12 15:20:19,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:19,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651021121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:19,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:19,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-12 15:20:19,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769084060] [2024-10-12 15:20:19,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:19,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:19,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:19,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:19,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:19,582 INFO L87 Difference]: Start difference. First operand 32193 states and 36725 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:19,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:19,962 INFO L93 Difference]: Finished difference Result 54587 states and 62166 transitions. [2024-10-12 15:20:19,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:19,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 328 [2024-10-12 15:20:19,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:19,983 INFO L225 Difference]: With dead ends: 54587 [2024-10-12 15:20:19,984 INFO L226 Difference]: Without dead ends: 22801 [2024-10-12 15:20:20,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 327 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-12 15:20:20,001 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 308 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:20,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 29 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 15:20:20,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22801 states. [2024-10-12 15:20:20,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22801 to 21786. [2024-10-12 15:20:20,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21786 states, 21785 states have (on average 1.128391094789993) internal successors, (24582), 21785 states have internal predecessors, (24582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21786 states to 21786 states and 24582 transitions. [2024-10-12 15:20:20,333 INFO L78 Accepts]: Start accepts. Automaton has 21786 states and 24582 transitions. Word has length 328 [2024-10-12 15:20:20,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:20,333 INFO L471 AbstractCegarLoop]: Abstraction has 21786 states and 24582 transitions. [2024-10-12 15:20:20,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:20,333 INFO L276 IsEmpty]: Start isEmpty. Operand 21786 states and 24582 transitions. [2024-10-12 15:20:20,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2024-10-12 15:20:20,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:20,353 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:20:20,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-12 15:20:20,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-12 15:20:20,554 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:20,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:20,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1306512217, now seen corresponding path program 1 times [2024-10-12 15:20:20,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:20,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603661776] [2024-10-12 15:20:20,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:20,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:21,852 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 157 proven. 6 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-12 15:20:21,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:21,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603661776] [2024-10-12 15:20:21,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603661776] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:21,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263990675] [2024-10-12 15:20:21,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:21,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:21,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:21,855 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:20:21,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-12 15:20:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:22,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:20:22,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:22,078 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-10-12 15:20:22,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:22,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263990675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:22,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:22,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 15:20:22,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125177258] [2024-10-12 15:20:22,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:22,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:22,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:22,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:22,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:20:22,080 INFO L87 Difference]: Start difference. First operand 21786 states and 24582 transitions. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:22,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:22,676 INFO L93 Difference]: Finished difference Result 41531 states and 46836 transitions. [2024-10-12 15:20:22,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:22,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 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 343 [2024-10-12 15:20:22,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:22,695 INFO L225 Difference]: With dead ends: 41531 [2024-10-12 15:20:22,695 INFO L226 Difference]: Without dead ends: 19949 [2024-10-12 15:20:22,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:20:22,709 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 253 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:22,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 328 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:20:22,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19949 states. [2024-10-12 15:20:22,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19949 to 18730. [2024-10-12 15:20:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18730 states, 18729 states have (on average 1.114795237332479) internal successors, (20879), 18729 states have internal predecessors, (20879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:22,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18730 states to 18730 states and 20879 transitions. [2024-10-12 15:20:22,861 INFO L78 Accepts]: Start accepts. Automaton has 18730 states and 20879 transitions. Word has length 343 [2024-10-12 15:20:22,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:22,861 INFO L471 AbstractCegarLoop]: Abstraction has 18730 states and 20879 transitions. [2024-10-12 15:20:22,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:22,861 INFO L276 IsEmpty]: Start isEmpty. Operand 18730 states and 20879 transitions. [2024-10-12 15:20:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2024-10-12 15:20:22,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:22,874 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:20:22,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-12 15:20:23,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:23,076 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:23,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:23,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1142351247, now seen corresponding path program 1 times [2024-10-12 15:20:23,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:23,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587380940] [2024-10-12 15:20:23,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:23,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:24,380 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 183 proven. 6 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-12 15:20:24,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:24,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587380940] [2024-10-12 15:20:24,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587380940] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:24,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565523086] [2024-10-12 15:20:24,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:24,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:24,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:24,382 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:20:24,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-12 15:20:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:24,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:20:24,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-12 15:20:24,733 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:24,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565523086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:24,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:24,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 15:20:24,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848085747] [2024-10-12 15:20:24,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:24,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:24,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:24,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:24,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:20:24,734 INFO L87 Difference]: Start difference. First operand 18730 states and 20879 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:25,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:25,309 INFO L93 Difference]: Finished difference Result 38681 states and 43100 transitions. [2024-10-12 15:20:25,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:25,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 375 [2024-10-12 15:20:25,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:25,311 INFO L225 Difference]: With dead ends: 38681 [2024-10-12 15:20:25,311 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 15:20:25,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:20:25,325 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 33 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:25,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 351 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:20:25,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 15:20:25,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 15:20:25,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:25,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 15:20:25,327 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 375 [2024-10-12 15:20:25,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:25,327 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 15:20:25,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:25,327 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 15:20:25,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 15:20:25,330 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:20:25,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-12 15:20:25,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:25,534 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:20:25,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 15:20:28,121 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:20:28,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:20:28 BoogieIcfgContainer [2024-10-12 15:20:28,172 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:20:28,172 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:20:28,172 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:20:28,172 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:20:28,176 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:19:45" (3/4) ... [2024-10-12 15:20:28,178 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 15:20:28,206 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-12 15:20:28,209 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 15:20:28,211 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 15:20:28,213 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 15:20:28,460 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:20:28,461 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 15:20:28,461 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:20:28,462 INFO L158 Benchmark]: Toolchain (without parser) took 45762.99ms. Allocated memory was 174.1MB in the beginning and 10.1GB in the end (delta: 10.0GB). Free memory was 100.3MB in the beginning and 7.5GB in the end (delta: -7.4GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2024-10-12 15:20:28,462 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:20:28,463 INFO L158 Benchmark]: CACSL2BoogieTranslator took 946.99ms. Allocated memory is still 174.1MB. Free memory was 100.1MB in the beginning and 116.8MB in the end (delta: -16.7MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-10-12 15:20:28,463 INFO L158 Benchmark]: Boogie Procedure Inliner took 144.96ms. Allocated memory is still 174.1MB. Free memory was 116.8MB in the beginning and 102.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 15:20:28,463 INFO L158 Benchmark]: Boogie Preprocessor took 161.13ms. Allocated memory is still 174.1MB. Free memory was 102.1MB in the beginning and 89.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 15:20:28,464 INFO L158 Benchmark]: RCFGBuilder took 1896.30ms. Allocated memory was 174.1MB in the beginning and 268.4MB in the end (delta: 94.4MB). Free memory was 89.5MB in the beginning and 157.5MB in the end (delta: -68.1MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. [2024-10-12 15:20:28,464 INFO L158 Benchmark]: TraceAbstraction took 42317.44ms. Allocated memory was 268.4MB in the beginning and 10.1GB in the end (delta: 9.9GB). Free memory was 156.5MB in the beginning and 7.5GB in the end (delta: -7.3GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2024-10-12 15:20:28,464 INFO L158 Benchmark]: Witness Printer took 289.11ms. Allocated memory is still 10.1GB. Free memory was 7.5GB in the beginning and 7.5GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-12 15:20:28,467 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 946.99ms. Allocated memory is still 174.1MB. Free memory was 100.1MB in the beginning and 116.8MB in the end (delta: -16.7MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 144.96ms. Allocated memory is still 174.1MB. Free memory was 116.8MB in the beginning and 102.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 161.13ms. Allocated memory is still 174.1MB. Free memory was 102.1MB in the beginning and 89.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1896.30ms. Allocated memory was 174.1MB in the beginning and 268.4MB in the end (delta: 94.4MB). Free memory was 89.5MB in the beginning and 157.5MB in the end (delta: -68.1MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. * TraceAbstraction took 42317.44ms. Allocated memory was 268.4MB in the beginning and 10.1GB in the end (delta: 9.9GB). Free memory was 156.5MB in the beginning and 7.5GB in the end (delta: -7.3GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Witness Printer took 289.11ms. Allocated memory is still 10.1GB. Free memory was 7.5GB in the beginning and 7.5GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1648]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 240 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.6s, OverallIterations: 20, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 16.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4161 SdHoareTripleChecker+Valid, 12.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4161 mSDsluCounter, 5108 SdHoareTripleChecker+Invalid, 10.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 443 mSDsCounter, 2180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11610 IncrementalHoareTripleChecker+Invalid, 13790 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2180 mSolverCounterUnsat, 4665 mSDtfsCounter, 11610 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3000 GetRequests, 2956 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40745occurred in iteration=11, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 15016 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 8215 NumberOfCodeBlocks, 8215 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 8185 ConstructedInterpolants, 0 QuantifiedInterpolants, 18484 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5552 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 30 InterpolantComputations, 20 PerfectInterpolantSequences, 3777/3837 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1668]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((a26 == 0) && (a5 == 1)) && (2 <= a3)) && (a11 == 1)) && (a27 <= 0)) && (a6 <= 0)) || (((((((a26 == 0) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1)) && (a27 <= 0))) || ((((((a5 == 1) && (a12 == 1)) && (a3 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 <= 0))) || ((((((a26 == 0) && (a5 == 1)) && (a3 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || (((((a5 == 1) && (2 <= a3)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1))) || ((((((a26 == 1) && (a5 == 1)) && (a3 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a3 == 1)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (2 <= a3)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || (((((a5 == 1) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a3 == 0))) || ((((((a26 == 1) && (a5 == 1)) && (2 <= a3)) && (a11 == 1)) && (a27 == 1)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1)) && (a27 <= 0))) || (((((a5 == 1) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a3 == 0))) || (((((a5 == 1) && (a11 == 1)) && (a3 == 1)) && (a27 == 1)) && (a6 <= 0))) || (((((a5 == 1) && (a11 <= 0)) && (a27 == 1)) && (a3 == 0)) && (a6 <= 0))) || ((((((a5 == 1) && (a12 == 1)) && (2 <= a3)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (2 <= a3)) && (a11 <= 0)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a3 == 1)) && (a11 <= 0)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a26 == 0) && (a5 == 1)) && (a3 == 1)) && (a11 <= 0)) && (a27 <= 0)) && (a6 <= 0))) || (((((a5 == 1) && (a3 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a3 == 0)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a26 == 0) && (a5 == 1)) && (2 <= a3)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1))) || ((((((a26 == 1) && (a5 == 1)) && (2 <= a3)) && (a11 == 1)) && (a6 == 1)) && (a27 <= 0))) || ((((((a26 == 0) && (a5 == 1)) && (2 <= a3)) && (a6 == 1)) && (a11 <= 0)) && (a27 <= 0))) || (((((a5 == 1) && (a11 == 1)) && (a27 == 1)) && (a3 == 0)) && (a6 <= 0))) || ((((((a26 == 0) && (a5 == 1)) && (2 <= a3)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || ((a26 == 1) && ((((((a5 == 1) && (a12 == 1)) && (a11 == 1)) && (a3 == 1)) && (a27 == 1)) || (((((a5 == 1) && (a12 == 1)) && (a11 == 1)) && (a27 == 1)) && (a3 == 0))))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a6 == 1)) && (a3 == 0)) && (a27 <= 0))) || (((((((a26 == 0) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a3 == 0)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 == 1)) && (a11 <= 0)) && (a27 == 1))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a3 == 0))) || (((((((a26 == 0) && (a5 == 1)) && (a12 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a3 == 0)) && (a27 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a3 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (2 <= a3)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a3 == 0)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a3 == 0)) && (a27 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1)) && (a27 == 1))) || ((((((a26 == 1) && (a5 == 1)) && (2 <= a3)) && (a6 == 1)) && (a11 <= 0)) && (a27 <= 0))) || ((((((a26 == 0) && (a5 == 1)) && (2 <= a3)) && (a11 == 1)) && (a27 == 1)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (2 <= a3)) && (a11 == 1)) && (a27 <= 0)) && (a6 <= 0))) RESULT: Ultimate proved your program to be correct! [2024-10-12 15:20:28,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE