./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label28.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/eca-rers2012/Problem15_label28.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 e1b64adb5298d170b0a0065804aa34285565fef303a8d1c9e978e6f35837be1e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:29:54,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:29:54,830 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:29:54,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:29:54,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:29:54,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:29:54,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:29:54,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:29:54,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:29:54,877 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:29:54,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:29:54,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:29:54,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:29:54,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:29:54,880 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:29:54,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:29:54,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:29:54,881 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:29:54,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:29:54,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:29:54,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:29:54,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:29:54,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:29:54,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:29:54,883 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:29:54,883 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:29:54,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:29:54,883 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:29:54,884 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:29:54,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:29:54,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:29:54,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:29:54,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:29:54,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:29:54,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:29:54,885 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:29:54,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:29:54,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:29:54,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:29:54,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:29:54,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:29:54,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:29:54,887 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 -> e1b64adb5298d170b0a0065804aa34285565fef303a8d1c9e978e6f35837be1e [2024-11-08 11:29:55,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:29:55,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:29:55,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:29:55,207 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:29:55,208 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:29:55,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label28.c [2024-11-08 11:29:56,597 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:29:56,894 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:29:56,895 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label28.c [2024-11-08 11:29:56,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/214f444db/3b81e943dceb48f39d4298a02429a323/FLAGfa448c02c [2024-11-08 11:29:56,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/214f444db/3b81e943dceb48f39d4298a02429a323 [2024-11-08 11:29:56,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:29:56,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:29:56,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:29:56,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:29:56,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:29:56,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:29:56" (1/1) ... [2024-11-08 11:29:56,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5846a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:56, skipping insertion in model container [2024-11-08 11:29:56,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:29:56" (1/1) ... [2024-11-08 11:29:56,990 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:29:57,154 WARN L250 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/Problem15_label28.c[4049,4062] [2024-11-08 11:29:57,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:29:57,446 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:29:57,458 WARN L250 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/Problem15_label28.c[4049,4062] [2024-11-08 11:29:57,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:29:57,655 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:29:57,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:57 WrapperNode [2024-11-08 11:29:57,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:29:57,657 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:29:57,657 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:29:57,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:29:57,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:57" (1/1) ... [2024-11-08 11:29:57,696 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:57" (1/1) ... [2024-11-08 11:29:57,789 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-11-08 11:29:57,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:29:57,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:29:57,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:29:57,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:29:57,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:57" (1/1) ... [2024-11-08 11:29:57,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:57" (1/1) ... [2024-11-08 11:29:57,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:57" (1/1) ... [2024-11-08 11:29:57,920 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-11-08 11:29:57,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:57" (1/1) ... [2024-11-08 11:29:57,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:57" (1/1) ... [2024-11-08 11:29:57,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:57" (1/1) ... [2024-11-08 11:29:57,984 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:57" (1/1) ... [2024-11-08 11:29:58,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:57" (1/1) ... [2024-11-08 11:29:58,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:57" (1/1) ... [2024-11-08 11:29:58,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:29:58,043 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:29:58,043 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:29:58,043 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:29:58,044 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:57" (1/1) ... [2024-11-08 11:29:58,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:29:58,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:29:58,076 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-11-08 11:29:58,082 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-11-08 11:29:58,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:29:58,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:29:58,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:29:58,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:29:58,171 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:29:58,172 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:30:00,009 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-11-08 11:30:00,009 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:30:00,027 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:30:00,027 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:30:00,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:30:00 BoogieIcfgContainer [2024-11-08 11:30:00,028 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:30:00,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:30:00,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:30:00,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:30:00,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:29:56" (1/3) ... [2024-11-08 11:30:00,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7429e719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:30:00, skipping insertion in model container [2024-11-08 11:30:00,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:57" (2/3) ... [2024-11-08 11:30:00,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7429e719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:30:00, skipping insertion in model container [2024-11-08 11:30:00,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:30:00" (3/3) ... [2024-11-08 11:30:00,038 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label28.c [2024-11-08 11:30:00,062 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:30:00,062 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:30:00,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:30:00,127 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;@31d192ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:30:00,128 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:30:00,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:00,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 11:30:00,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:00,137 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] [2024-11-08 11:30:00,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:00,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:00,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1317301102, now seen corresponding path program 1 times [2024-11-08 11:30:00,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:00,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233288526] [2024-11-08 11:30:00,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:00,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:00,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:30:00,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:00,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233288526] [2024-11-08 11:30:00,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233288526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:00,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:00,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:30:00,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147153120] [2024-11-08 11:30:00,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:00,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:00,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:00,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:00,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:00,431 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 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 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:01,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:01,830 INFO L93 Difference]: Finished difference Result 1155 states and 2106 transitions. [2024-11-08 11:30:01,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:01,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-08 11:30:01,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:01,851 INFO L225 Difference]: With dead ends: 1155 [2024-11-08 11:30:01,851 INFO L226 Difference]: Without dead ends: 667 [2024-11-08 11:30:01,859 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-11-08 11:30:01,865 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 312 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:01,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 371 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 11:30:01,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-11-08 11:30:01,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2024-11-08 11:30:01,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 664 states have (on average 1.4789156626506024) internal successors, (982), 664 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:01,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 982 transitions. [2024-11-08 11:30:01,942 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 982 transitions. Word has length 32 [2024-11-08 11:30:01,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:01,943 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 982 transitions. [2024-11-08 11:30:01,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:01,943 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 982 transitions. [2024-11-08 11:30:01,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 11:30:01,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:01,946 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 11:30:01,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:30:01,946 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:01,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:01,947 INFO L85 PathProgramCache]: Analyzing trace with hash 251864749, now seen corresponding path program 1 times [2024-11-08 11:30:01,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:01,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988711027] [2024-11-08 11:30:01,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:01,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:02,114 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:30:02,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:02,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988711027] [2024-11-08 11:30:02,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988711027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:02,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:02,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:30:02,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366158273] [2024-11-08 11:30:02,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:02,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:02,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:02,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:02,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:02,117 INFO L87 Difference]: Start difference. First operand 665 states and 982 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:03,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:03,754 INFO L93 Difference]: Finished difference Result 1955 states and 2894 transitions. [2024-11-08 11:30:03,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:03,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-11-08 11:30:03,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:03,759 INFO L225 Difference]: With dead ends: 1955 [2024-11-08 11:30:03,759 INFO L226 Difference]: Without dead ends: 1292 [2024-11-08 11:30:03,760 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-11-08 11:30:03,761 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 258 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:03,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 327 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 11:30:03,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2024-11-08 11:30:03,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1282. [2024-11-08 11:30:03,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1281 states have (on average 1.3989071038251366) internal successors, (1792), 1281 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:03,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1792 transitions. [2024-11-08 11:30:03,802 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1792 transitions. Word has length 107 [2024-11-08 11:30:03,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:03,802 INFO L471 AbstractCegarLoop]: Abstraction has 1282 states and 1792 transitions. [2024-11-08 11:30:03,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1792 transitions. [2024-11-08 11:30:03,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 11:30:03,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:03,807 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 11:30:03,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:30:03,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:03,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:03,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1575980701, now seen corresponding path program 1 times [2024-11-08 11:30:03,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:03,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536592540] [2024-11-08 11:30:03,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:03,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:03,992 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:30:03,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:03,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536592540] [2024-11-08 11:30:03,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536592540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:03,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:03,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:30:03,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601755676] [2024-11-08 11:30:03,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:03,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:03,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:03,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:03,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:03,994 INFO L87 Difference]: Start difference. First operand 1282 states and 1792 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:05,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:05,409 INFO L93 Difference]: Finished difference Result 3764 states and 5263 transitions. [2024-11-08 11:30:05,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:05,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-11-08 11:30:05,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:05,416 INFO L225 Difference]: With dead ends: 3764 [2024-11-08 11:30:05,417 INFO L226 Difference]: Without dead ends: 2484 [2024-11-08 11:30:05,418 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-11-08 11:30:05,419 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 236 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:05,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 366 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 11:30:05,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2024-11-08 11:30:05,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2182. [2024-11-08 11:30:05,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 2181 states have (on average 1.2815222375057314) internal successors, (2795), 2181 states have internal predecessors, (2795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:05,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 2795 transitions. [2024-11-08 11:30:05,447 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 2795 transitions. Word has length 111 [2024-11-08 11:30:05,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:05,447 INFO L471 AbstractCegarLoop]: Abstraction has 2182 states and 2795 transitions. [2024-11-08 11:30:05,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:05,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2795 transitions. [2024-11-08 11:30:05,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-08 11:30:05,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:05,450 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:30:05,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:30:05,451 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:05,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:05,451 INFO L85 PathProgramCache]: Analyzing trace with hash -445236617, now seen corresponding path program 1 times [2024-11-08 11:30:05,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:05,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964404188] [2024-11-08 11:30:05,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:05,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:05,667 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-08 11:30:05,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:05,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964404188] [2024-11-08 11:30:05,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964404188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:05,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:05,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:30:05,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662064832] [2024-11-08 11:30:05,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:05,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:05,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:05,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:05,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:05,671 INFO L87 Difference]: Start difference. First operand 2182 states and 2795 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:06,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:06,947 INFO L93 Difference]: Finished difference Result 6166 states and 7961 transitions. [2024-11-08 11:30:06,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:06,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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 202 [2024-11-08 11:30:06,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:06,957 INFO L225 Difference]: With dead ends: 6166 [2024-11-08 11:30:06,957 INFO L226 Difference]: Without dead ends: 3986 [2024-11-08 11:30:06,960 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-11-08 11:30:06,961 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:06,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 339 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 11:30:06,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2024-11-08 11:30:06,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3682. [2024-11-08 11:30:07,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3682 states, 3681 states have (on average 1.2200488997555012) internal successors, (4491), 3681 states have internal predecessors, (4491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:07,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 4491 transitions. [2024-11-08 11:30:07,005 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 4491 transitions. Word has length 202 [2024-11-08 11:30:07,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:07,007 INFO L471 AbstractCegarLoop]: Abstraction has 3682 states and 4491 transitions. [2024-11-08 11:30:07,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:07,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 4491 transitions. [2024-11-08 11:30:07,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2024-11-08 11:30:07,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:07,010 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:30:07,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:30:07,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:07,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:07,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1158649091, now seen corresponding path program 1 times [2024-11-08 11:30:07,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:07,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053487300] [2024-11-08 11:30:07,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:07,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:07,538 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-08 11:30:07,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:07,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053487300] [2024-11-08 11:30:07,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053487300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:07,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:07,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:30:07,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103502658] [2024-11-08 11:30:07,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:07,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:07,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:07,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:07,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:07,541 INFO L87 Difference]: Start difference. First operand 3682 states and 4491 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:08,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:08,530 INFO L93 Difference]: Finished difference Result 7661 states and 9291 transitions. [2024-11-08 11:30:08,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:08,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 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 304 [2024-11-08 11:30:08,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:08,582 INFO L225 Difference]: With dead ends: 7661 [2024-11-08 11:30:08,582 INFO L226 Difference]: Without dead ends: 3981 [2024-11-08 11:30:08,585 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-11-08 11:30:08,586 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:08,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 11:30:08,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2024-11-08 11:30:08,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3981. [2024-11-08 11:30:08,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3981 states, 3980 states have (on average 1.2050251256281408) internal successors, (4796), 3980 states have internal predecessors, (4796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 4796 transitions. [2024-11-08 11:30:08,631 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 4796 transitions. Word has length 304 [2024-11-08 11:30:08,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:08,632 INFO L471 AbstractCegarLoop]: Abstraction has 3981 states and 4796 transitions. [2024-11-08 11:30:08,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:08,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 4796 transitions. [2024-11-08 11:30:08,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2024-11-08 11:30:08,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:08,635 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:30:08,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:30:08,635 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:08,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:08,636 INFO L85 PathProgramCache]: Analyzing trace with hash 579536590, now seen corresponding path program 1 times [2024-11-08 11:30:08,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:08,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448750994] [2024-11-08 11:30:08,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:08,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-08 11:30:08,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:08,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448750994] [2024-11-08 11:30:08,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448750994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:08,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:08,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:30:08,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118964429] [2024-11-08 11:30:08,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:08,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:08,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:08,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:08,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:08,906 INFO L87 Difference]: Start difference. First operand 3981 states and 4796 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-11-08 11:30:10,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:10,099 INFO L93 Difference]: Finished difference Result 8857 states and 10953 transitions. [2024-11-08 11:30:10,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:10,100 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 319 [2024-11-08 11:30:10,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:10,115 INFO L225 Difference]: With dead ends: 8857 [2024-11-08 11:30:10,115 INFO L226 Difference]: Without dead ends: 5177 [2024-11-08 11:30:10,149 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-11-08 11:30:10,152 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 283 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:10,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 322 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 11:30:10,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5177 states. [2024-11-08 11:30:10,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5177 to 3678. [2024-11-08 11:30:10,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3678 states, 3677 states have (on average 1.2181125917867828) internal successors, (4479), 3677 states have internal predecessors, (4479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:10,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 4479 transitions. [2024-11-08 11:30:10,221 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 4479 transitions. Word has length 319 [2024-11-08 11:30:10,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:10,222 INFO L471 AbstractCegarLoop]: Abstraction has 3678 states and 4479 transitions. [2024-11-08 11:30:10,222 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-11-08 11:30:10,223 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 4479 transitions. [2024-11-08 11:30:10,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2024-11-08 11:30:10,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:10,228 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:30:10,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:30:10,229 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:10,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:10,229 INFO L85 PathProgramCache]: Analyzing trace with hash -84480945, now seen corresponding path program 1 times [2024-11-08 11:30:10,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:10,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279299378] [2024-11-08 11:30:10,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:10,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-08 11:30:10,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:10,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279299378] [2024-11-08 11:30:10,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279299378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:10,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:10,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:30:10,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448396815] [2024-11-08 11:30:10,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:10,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:10,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:10,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:10,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:10,496 INFO L87 Difference]: Start difference. First operand 3678 states and 4479 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:11,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:11,674 INFO L93 Difference]: Finished difference Result 9157 states and 11369 transitions. [2024-11-08 11:30:11,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:11,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 378 [2024-11-08 11:30:11,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:11,697 INFO L225 Difference]: With dead ends: 9157 [2024-11-08 11:30:11,701 INFO L226 Difference]: Without dead ends: 5780 [2024-11-08 11:30:11,705 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-11-08 11:30:11,709 INFO L432 NwaCegarLoop]: 600 mSDtfsCounter, 296 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:11,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 637 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 11:30:11,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5780 states. [2024-11-08 11:30:11,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5780 to 5182. [2024-11-08 11:30:11,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5182 states, 5181 states have (on average 1.1767998455896544) internal successors, (6097), 5181 states have internal predecessors, (6097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:11,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5182 states to 5182 states and 6097 transitions. [2024-11-08 11:30:11,826 INFO L78 Accepts]: Start accepts. Automaton has 5182 states and 6097 transitions. Word has length 378 [2024-11-08 11:30:11,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:11,826 INFO L471 AbstractCegarLoop]: Abstraction has 5182 states and 6097 transitions. [2024-11-08 11:30:11,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:11,827 INFO L276 IsEmpty]: Start isEmpty. Operand 5182 states and 6097 transitions. [2024-11-08 11:30:11,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2024-11-08 11:30:11,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:11,830 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:30:11,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:30:11,830 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:11,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:11,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1647724765, now seen corresponding path program 1 times [2024-11-08 11:30:11,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:11,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630974243] [2024-11-08 11:30:11,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:11,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:12,038 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:30:12,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:12,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630974243] [2024-11-08 11:30:12,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630974243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:12,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:12,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:30:12,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135877413] [2024-11-08 11:30:12,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:12,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:12,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:12,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:12,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:12,041 INFO L87 Difference]: Start difference. First operand 5182 states and 6097 transitions. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:13,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:13,314 INFO L93 Difference]: Finished difference Result 11868 states and 14277 transitions. [2024-11-08 11:30:13,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:13,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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 384 [2024-11-08 11:30:13,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:13,329 INFO L225 Difference]: With dead ends: 11868 [2024-11-08 11:30:13,330 INFO L226 Difference]: Without dead ends: 6987 [2024-11-08 11:30:13,336 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-11-08 11:30:13,336 INFO L432 NwaCegarLoop]: 564 mSDtfsCounter, 248 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:13,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 603 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 11:30:13,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6987 states. [2024-11-08 11:30:13,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6987 to 6087. [2024-11-08 11:30:13,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6087 states, 6086 states have (on average 1.1628327308577062) internal successors, (7077), 6086 states have internal predecessors, (7077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:13,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6087 states to 6087 states and 7077 transitions. [2024-11-08 11:30:13,445 INFO L78 Accepts]: Start accepts. Automaton has 6087 states and 7077 transitions. Word has length 384 [2024-11-08 11:30:13,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:13,445 INFO L471 AbstractCegarLoop]: Abstraction has 6087 states and 7077 transitions. [2024-11-08 11:30:13,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:13,446 INFO L276 IsEmpty]: Start isEmpty. Operand 6087 states and 7077 transitions. [2024-11-08 11:30:13,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2024-11-08 11:30:13,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:13,450 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 11:30:13,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:30:13,450 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:13,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:13,450 INFO L85 PathProgramCache]: Analyzing trace with hash 747271101, now seen corresponding path program 1 times [2024-11-08 11:30:13,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:13,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866582165] [2024-11-08 11:30:13,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:13,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:13,641 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-08 11:30:13,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:13,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866582165] [2024-11-08 11:30:13,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866582165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:13,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:13,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:30:13,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93377459] [2024-11-08 11:30:13,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:13,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:13,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:13,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:13,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:13,644 INFO L87 Difference]: Start difference. First operand 6087 states and 7077 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:14,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:14,825 INFO L93 Difference]: Finished difference Result 13667 states and 16224 transitions. [2024-11-08 11:30:14,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:14,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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 401 [2024-11-08 11:30:14,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:14,886 INFO L225 Difference]: With dead ends: 13667 [2024-11-08 11:30:14,887 INFO L226 Difference]: Without dead ends: 7881 [2024-11-08 11:30:14,890 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-11-08 11:30:14,892 INFO L432 NwaCegarLoop]: 579 mSDtfsCounter, 248 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:14,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 617 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 11:30:14,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7881 states. [2024-11-08 11:30:14,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7881 to 7877. [2024-11-08 11:30:14,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7877 states, 7876 states have (on average 1.1457592686642966) internal successors, (9024), 7876 states have internal predecessors, (9024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:14,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7877 states to 7877 states and 9024 transitions. [2024-11-08 11:30:14,957 INFO L78 Accepts]: Start accepts. Automaton has 7877 states and 9024 transitions. Word has length 401 [2024-11-08 11:30:14,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:14,957 INFO L471 AbstractCegarLoop]: Abstraction has 7877 states and 9024 transitions. [2024-11-08 11:30:14,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:14,958 INFO L276 IsEmpty]: Start isEmpty. Operand 7877 states and 9024 transitions. [2024-11-08 11:30:14,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-08 11:30:14,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:14,961 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:30:14,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:30:14,961 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:14,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:14,961 INFO L85 PathProgramCache]: Analyzing trace with hash 624859565, now seen corresponding path program 1 times [2024-11-08 11:30:14,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:14,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677707168] [2024-11-08 11:30:14,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:14,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:15,491 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 30 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:30:15,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:15,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677707168] [2024-11-08 11:30:15,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677707168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:30:15,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800362927] [2024-11-08 11:30:15,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:15,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:30:15,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:30:15,497 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-11-08 11:30:15,500 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-11-08 11:30:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:15,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:30:15,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:30:15,814 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-08 11:30:15,814 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:30:15,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800362927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:15,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:30:15,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 11:30:15,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606259160] [2024-11-08 11:30:15,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:15,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:15,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:15,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:15,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:30:15,815 INFO L87 Difference]: Start difference. First operand 7877 states and 9024 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:17,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:17,239 INFO L93 Difference]: Finished difference Result 18510 states and 21585 transitions. [2024-11-08 11:30:17,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:17,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 409 [2024-11-08 11:30:17,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:17,261 INFO L225 Difference]: With dead ends: 18510 [2024-11-08 11:30:17,262 INFO L226 Difference]: Without dead ends: 10934 [2024-11-08 11:30:17,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:30:17,278 INFO L432 NwaCegarLoop]: 572 mSDtfsCounter, 383 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:17,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 636 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 11:30:17,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10934 states. [2024-11-08 11:30:17,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10934 to 10928. [2024-11-08 11:30:17,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10928 states, 10927 states have (on average 1.1586894847625149) internal successors, (12661), 10927 states have internal predecessors, (12661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:17,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10928 states to 10928 states and 12661 transitions. [2024-11-08 11:30:17,422 INFO L78 Accepts]: Start accepts. Automaton has 10928 states and 12661 transitions. Word has length 409 [2024-11-08 11:30:17,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:17,424 INFO L471 AbstractCegarLoop]: Abstraction has 10928 states and 12661 transitions. [2024-11-08 11:30:17,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:17,424 INFO L276 IsEmpty]: Start isEmpty. Operand 10928 states and 12661 transitions. [2024-11-08 11:30:17,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2024-11-08 11:30:17,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:17,428 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 11:30:17,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 11:30:17,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 11:30:17,630 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:17,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:17,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1176515794, now seen corresponding path program 1 times [2024-11-08 11:30:17,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:17,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659906412] [2024-11-08 11:30:17,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:17,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-08 11:30:17,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:17,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659906412] [2024-11-08 11:30:17,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659906412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:17,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:17,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:30:17,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389244822] [2024-11-08 11:30:17,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:17,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:17,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:17,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:17,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:17,983 INFO L87 Difference]: Start difference. First operand 10928 states and 12661 transitions. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:19,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:19,130 INFO L93 Difference]: Finished difference Result 28431 states and 33049 transitions. [2024-11-08 11:30:19,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:19,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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 481 [2024-11-08 11:30:19,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:19,153 INFO L225 Difference]: With dead ends: 28431 [2024-11-08 11:30:19,154 INFO L226 Difference]: Without dead ends: 17804 [2024-11-08 11:30:19,163 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-11-08 11:30:19,164 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 308 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:19,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 169 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 11:30:19,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17804 states. [2024-11-08 11:30:19,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17804 to 15711. [2024-11-08 11:30:19,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15711 states, 15710 states have (on average 1.1535327816677277) internal successors, (18122), 15710 states have internal predecessors, (18122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15711 states to 15711 states and 18122 transitions. [2024-11-08 11:30:19,398 INFO L78 Accepts]: Start accepts. Automaton has 15711 states and 18122 transitions. Word has length 481 [2024-11-08 11:30:19,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:19,399 INFO L471 AbstractCegarLoop]: Abstraction has 15711 states and 18122 transitions. [2024-11-08 11:30:19,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 15711 states and 18122 transitions. [2024-11-08 11:30:19,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2024-11-08 11:30:19,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:19,403 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2024-11-08 11:30:19,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 11:30:19,403 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:19,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:19,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1477871461, now seen corresponding path program 1 times [2024-11-08 11:30:19,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:19,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116093133] [2024-11-08 11:30:19,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:19,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:19,833 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 469 proven. 39 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-08 11:30:19,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:19,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116093133] [2024-11-08 11:30:19,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116093133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:30:19,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399962840] [2024-11-08 11:30:19,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:19,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:30:19,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:30:19,836 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-11-08 11:30:19,837 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-11-08 11:30:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:20,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:30:20,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:30:20,111 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-11-08 11:30:20,112 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:30:20,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399962840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:20,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:30:20,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 11:30:20,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142822379] [2024-11-08 11:30:20,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:20,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:20,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:20,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:20,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:30:20,114 INFO L87 Difference]: Start difference. First operand 15711 states and 18122 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:21,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:21,250 INFO L93 Difference]: Finished difference Result 35602 states and 41106 transitions. [2024-11-08 11:30:21,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:21,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 516 [2024-11-08 11:30:21,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:21,279 INFO L225 Difference]: With dead ends: 35602 [2024-11-08 11:30:21,279 INFO L226 Difference]: Without dead ends: 20192 [2024-11-08 11:30:21,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:30:21,294 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 316 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:21,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 245 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:30:21,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20192 states. [2024-11-08 11:30:21,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20192 to 18396. [2024-11-08 11:30:21,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18396 states, 18395 states have (on average 1.1465072030443055) internal successors, (21090), 18395 states have internal predecessors, (21090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:21,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18396 states to 18396 states and 21090 transitions. [2024-11-08 11:30:21,480 INFO L78 Accepts]: Start accepts. Automaton has 18396 states and 21090 transitions. Word has length 516 [2024-11-08 11:30:21,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:21,480 INFO L471 AbstractCegarLoop]: Abstraction has 18396 states and 21090 transitions. [2024-11-08 11:30:21,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:21,481 INFO L276 IsEmpty]: Start isEmpty. Operand 18396 states and 21090 transitions. [2024-11-08 11:30:21,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2024-11-08 11:30:21,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:21,484 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2024-11-08 11:30:21,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 11:30:21,688 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,SelfDestructingSolverStorable11 [2024-11-08 11:30:21,689 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:21,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:21,690 INFO L85 PathProgramCache]: Analyzing trace with hash -629138351, now seen corresponding path program 1 times [2024-11-08 11:30:21,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:21,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29451941] [2024-11-08 11:30:21,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:21,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:22,326 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 355 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-11-08 11:30:22,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:22,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29451941] [2024-11-08 11:30:22,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29451941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:22,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:22,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:30:22,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134910235] [2024-11-08 11:30:22,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:22,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:22,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:22,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:22,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:22,329 INFO L87 Difference]: Start difference. First operand 18396 states and 21090 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:23,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:23,920 INFO L93 Difference]: Finished difference Result 44289 states and 51198 transitions. [2024-11-08 11:30:23,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:23,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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 520 [2024-11-08 11:30:23,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:23,949 INFO L225 Difference]: With dead ends: 44289 [2024-11-08 11:30:23,949 INFO L226 Difference]: Without dead ends: 26194 [2024-11-08 11:30:23,962 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-11-08 11:30:23,963 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:23,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 619 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 11:30:23,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26194 states. [2024-11-08 11:30:24,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26194 to 25576. [2024-11-08 11:30:24,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25576 states, 25575 states have (on average 1.1351319648093843) internal successors, (29031), 25575 states have internal predecessors, (29031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:24,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25576 states to 25576 states and 29031 transitions. [2024-11-08 11:30:24,271 INFO L78 Accepts]: Start accepts. Automaton has 25576 states and 29031 transitions. Word has length 520 [2024-11-08 11:30:24,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:24,272 INFO L471 AbstractCegarLoop]: Abstraction has 25576 states and 29031 transitions. [2024-11-08 11:30:24,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:24,272 INFO L276 IsEmpty]: Start isEmpty. Operand 25576 states and 29031 transitions. [2024-11-08 11:30:24,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2024-11-08 11:30:24,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:24,280 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 11:30:24,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 11:30:24,280 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:24,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:24,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1866465979, now seen corresponding path program 1 times [2024-11-08 11:30:24,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:24,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056699810] [2024-11-08 11:30:24,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:24,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 527 proven. 39 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-11-08 11:30:24,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:24,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056699810] [2024-11-08 11:30:24,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056699810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:30:24,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460564441] [2024-11-08 11:30:24,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:24,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:30:24,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:30:24,765 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-11-08 11:30:24,769 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-11-08 11:30:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:24,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:30:24,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:30:24,961 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-11-08 11:30:24,962 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:30:24,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460564441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:24,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:30:24,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 11:30:24,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059517156] [2024-11-08 11:30:24,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:24,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:24,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:24,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:24,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:30:24,964 INFO L87 Difference]: Start difference. First operand 25576 states and 29031 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:26,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:26,213 INFO L93 Difference]: Finished difference Result 54737 states and 62400 transitions. [2024-11-08 11:30:26,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:26,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 560 [2024-11-08 11:30:26,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:26,243 INFO L225 Difference]: With dead ends: 54737 [2024-11-08 11:30:26,243 INFO L226 Difference]: Without dead ends: 29462 [2024-11-08 11:30:26,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 559 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:30:26,260 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 382 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:26,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 444 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 11:30:26,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29462 states. [2024-11-08 11:30:26,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29462 to 21031. [2024-11-08 11:30:26,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21031 states, 21030 states have (on average 1.1193057536852116) internal successors, (23539), 21030 states have internal predecessors, (23539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:26,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21031 states to 21031 states and 23539 transitions. [2024-11-08 11:30:26,504 INFO L78 Accepts]: Start accepts. Automaton has 21031 states and 23539 transitions. Word has length 560 [2024-11-08 11:30:26,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:26,504 INFO L471 AbstractCegarLoop]: Abstraction has 21031 states and 23539 transitions. [2024-11-08 11:30:26,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:26,504 INFO L276 IsEmpty]: Start isEmpty. Operand 21031 states and 23539 transitions. [2024-11-08 11:30:26,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2024-11-08 11:30:26,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:26,511 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:30:26,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 11:30:26,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:30:26,712 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:26,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:26,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1840183349, now seen corresponding path program 1 times [2024-11-08 11:30:26,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:26,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418355995] [2024-11-08 11:30:26,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:26,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2024-11-08 11:30:27,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:27,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418355995] [2024-11-08 11:30:27,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418355995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:27,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:27,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:30:27,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195937487] [2024-11-08 11:30:27,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:27,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:27,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:27,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:27,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:27,125 INFO L87 Difference]: Start difference. First operand 21031 states and 23539 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:28,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:28,793 INFO L93 Difference]: Finished difference Result 48351 states and 54188 transitions. [2024-11-08 11:30:28,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:28,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 594 [2024-11-08 11:30:28,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:28,819 INFO L225 Difference]: With dead ends: 48351 [2024-11-08 11:30:28,820 INFO L226 Difference]: Without dead ends: 24332 [2024-11-08 11:30:28,837 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-11-08 11:30:28,837 INFO L432 NwaCegarLoop]: 610 mSDtfsCounter, 310 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:28,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 654 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 11:30:28,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24332 states. [2024-11-08 11:30:29,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24332 to 23435. [2024-11-08 11:30:29,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23435 states, 23434 states have (on average 1.0909789195186481) internal successors, (25566), 23434 states have internal predecessors, (25566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:29,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23435 states to 23435 states and 25566 transitions. [2024-11-08 11:30:29,100 INFO L78 Accepts]: Start accepts. Automaton has 23435 states and 25566 transitions. Word has length 594 [2024-11-08 11:30:29,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:29,101 INFO L471 AbstractCegarLoop]: Abstraction has 23435 states and 25566 transitions. [2024-11-08 11:30:29,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:29,101 INFO L276 IsEmpty]: Start isEmpty. Operand 23435 states and 25566 transitions. [2024-11-08 11:30:29,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2024-11-08 11:30:29,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:29,111 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 11:30:29,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 11:30:29,111 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:29,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:29,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1668920954, now seen corresponding path program 1 times [2024-11-08 11:30:29,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:29,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337768227] [2024-11-08 11:30:29,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:29,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:29,403 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 11:30:29,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:29,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337768227] [2024-11-08 11:30:29,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337768227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:29,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:29,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:30:29,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378912870] [2024-11-08 11:30:29,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:29,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:29,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:29,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:29,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:29,404 INFO L87 Difference]: Start difference. First operand 23435 states and 25566 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:30,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:30,519 INFO L93 Difference]: Finished difference Result 46268 states and 50515 transitions. [2024-11-08 11:30:30,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:30,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 615 [2024-11-08 11:30:30,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:30,540 INFO L225 Difference]: With dead ends: 46268 [2024-11-08 11:30:30,540 INFO L226 Difference]: Without dead ends: 23134 [2024-11-08 11:30:30,553 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-11-08 11:30:30,554 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 464 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:30,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 70 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:30:30,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23134 states. [2024-11-08 11:30:30,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23134 to 23134. [2024-11-08 11:30:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23134 states, 23133 states have (on average 1.0916872001037479) internal successors, (25254), 23133 states have internal predecessors, (25254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:30,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23134 states to 23134 states and 25254 transitions. [2024-11-08 11:30:30,803 INFO L78 Accepts]: Start accepts. Automaton has 23134 states and 25254 transitions. Word has length 615 [2024-11-08 11:30:30,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:30,804 INFO L471 AbstractCegarLoop]: Abstraction has 23134 states and 25254 transitions. [2024-11-08 11:30:30,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:30,804 INFO L276 IsEmpty]: Start isEmpty. Operand 23134 states and 25254 transitions. [2024-11-08 11:30:30,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2024-11-08 11:30:30,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:30,811 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2024-11-08 11:30:30,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 11:30:30,811 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:30,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:30,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1206065002, now seen corresponding path program 1 times [2024-11-08 11:30:30,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:30,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12830991] [2024-11-08 11:30:30,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:30,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1084 backedges. 685 proven. 39 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-08 11:30:31,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:31,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12830991] [2024-11-08 11:30:31,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12830991] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:30:31,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124635344] [2024-11-08 11:30:31,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:31,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:30:31,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:30:31,341 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-11-08 11:30:31,342 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-11-08 11:30:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:31,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:30:31,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:30:31,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1084 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-11-08 11:30:31,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:30:31,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124635344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:31,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:30:31,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 11:30:31,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611837905] [2024-11-08 11:30:31,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:31,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:31,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:31,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:31,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:30:31,636 INFO L87 Difference]: Start difference. First operand 23134 states and 25254 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:33,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:33,020 INFO L93 Difference]: Finished difference Result 45062 states and 49228 transitions. [2024-11-08 11:30:33,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:33,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 642 [2024-11-08 11:30:33,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:33,041 INFO L225 Difference]: With dead ends: 45062 [2024-11-08 11:30:33,041 INFO L226 Difference]: Without dead ends: 22229 [2024-11-08 11:30:33,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:30:33,054 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 202 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:33,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 566 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 11:30:33,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22229 states. [2024-11-08 11:30:33,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22229 to 21630. [2024-11-08 11:30:33,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21630 states, 21629 states have (on average 1.0579777151047205) internal successors, (22883), 21629 states have internal predecessors, (22883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21630 states to 21630 states and 22883 transitions. [2024-11-08 11:30:33,381 INFO L78 Accepts]: Start accepts. Automaton has 21630 states and 22883 transitions. Word has length 642 [2024-11-08 11:30:33,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:33,382 INFO L471 AbstractCegarLoop]: Abstraction has 21630 states and 22883 transitions. [2024-11-08 11:30:33,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 21630 states and 22883 transitions. [2024-11-08 11:30:33,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2024-11-08 11:30:33,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:33,394 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:30:33,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 11:30:33,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-08 11:30:33,595 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:33,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:33,595 INFO L85 PathProgramCache]: Analyzing trace with hash 291937418, now seen corresponding path program 1 times [2024-11-08 11:30:33,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:33,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072560786] [2024-11-08 11:30:33,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:33,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:34,336 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 625 proven. 39 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-11-08 11:30:34,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:34,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072560786] [2024-11-08 11:30:34,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072560786] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:30:34,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35196738] [2024-11-08 11:30:34,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:34,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:30:34,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:30:34,340 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-11-08 11:30:34,348 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-11-08 11:30:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:34,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 11:30:34,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:30:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 625 proven. 39 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-11-08 11:30:35,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:30:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 625 proven. 39 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-11-08 11:30:35,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35196738] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 11:30:35,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 11:30:35,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-08 11:30:35,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109321931] [2024-11-08 11:30:35,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 11:30:35,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 11:30:35,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:35,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 11:30:35,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:30:35,571 INFO L87 Difference]: Start difference. First operand 21630 states and 22883 transitions. Second operand has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:39,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:39,668 INFO L93 Difference]: Finished difference Result 51293 states and 54243 transitions. [2024-11-08 11:30:39,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 11:30:39,669 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 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 656 [2024-11-08 11:30:39,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:39,689 INFO L225 Difference]: With dead ends: 51293 [2024-11-08 11:30:39,689 INFO L226 Difference]: Without dead ends: 23425 [2024-11-08 11:30:39,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1321 GetRequests, 1307 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2024-11-08 11:30:39,705 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 3105 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4632 mSolverCounterSat, 468 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3105 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 5100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 468 IncrementalHoareTripleChecker+Valid, 4632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:39,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3105 Valid, 204 Invalid, 5100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [468 Valid, 4632 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-08 11:30:39,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23425 states. [2024-11-08 11:30:39,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23425 to 19535. [2024-11-08 11:30:39,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19535 states, 19534 states have (on average 1.0309204464011468) internal successors, (20138), 19534 states have internal predecessors, (20138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19535 states to 19535 states and 20138 transitions. [2024-11-08 11:30:40,014 INFO L78 Accepts]: Start accepts. Automaton has 19535 states and 20138 transitions. Word has length 656 [2024-11-08 11:30:40,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:40,014 INFO L471 AbstractCegarLoop]: Abstraction has 19535 states and 20138 transitions. [2024-11-08 11:30:40,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:40,015 INFO L276 IsEmpty]: Start isEmpty. Operand 19535 states and 20138 transitions. [2024-11-08 11:30:40,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2024-11-08 11:30:40,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:40,021 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 11:30:40,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 11:30:40,222 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,SelfDestructingSolverStorable17 [2024-11-08 11:30:40,223 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:40,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:40,223 INFO L85 PathProgramCache]: Analyzing trace with hash -2007667598, now seen corresponding path program 1 times [2024-11-08 11:30:40,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:40,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361848163] [2024-11-08 11:30:40,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:40,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:40,554 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-11-08 11:30:40,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:40,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361848163] [2024-11-08 11:30:40,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361848163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:40,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:40,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:30:40,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113361552] [2024-11-08 11:30:40,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:40,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:30:40,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:40,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:30:40,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:30:40,560 INFO L87 Difference]: Start difference. First operand 19535 states and 20138 transitions. Second operand has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:42,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:42,044 INFO L93 Difference]: Finished difference Result 41764 states and 43075 transitions. [2024-11-08 11:30:42,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:30:42,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 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 659 [2024-11-08 11:30:42,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:42,065 INFO L225 Difference]: With dead ends: 41764 [2024-11-08 11:30:42,065 INFO L226 Difference]: Without dead ends: 22530 [2024-11-08 11:30:42,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:30:42,079 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 615 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:42,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 419 Invalid, 1610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 11:30:42,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22530 states. [2024-11-08 11:30:42,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22530 to 21929. [2024-11-08 11:30:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21929 states, 21928 states have (on average 1.0263589930682233) internal successors, (22506), 21928 states have internal predecessors, (22506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:42,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21929 states to 21929 states and 22506 transitions. [2024-11-08 11:30:42,336 INFO L78 Accepts]: Start accepts. Automaton has 21929 states and 22506 transitions. Word has length 659 [2024-11-08 11:30:42,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:42,336 INFO L471 AbstractCegarLoop]: Abstraction has 21929 states and 22506 transitions. [2024-11-08 11:30:42,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:42,336 INFO L276 IsEmpty]: Start isEmpty. Operand 21929 states and 22506 transitions. [2024-11-08 11:30:42,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2024-11-08 11:30:42,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:42,351 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:30:42,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 11:30:42,351 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:42,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:42,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1673837868, now seen corresponding path program 1 times [2024-11-08 11:30:42,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:42,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813581322] [2024-11-08 11:30:42,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:42,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:43,075 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2024-11-08 11:30:43,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:43,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813581322] [2024-11-08 11:30:43,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813581322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:43,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:43,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:30:43,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830724840] [2024-11-08 11:30:43,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:43,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:43,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:43,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:43,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:43,080 INFO L87 Difference]: Start difference. First operand 21929 states and 22506 transitions. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:43,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:43,998 INFO L93 Difference]: Finished difference Result 46858 states and 48100 transitions. [2024-11-08 11:30:43,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:43,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 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 699 [2024-11-08 11:30:43,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:44,021 INFO L225 Difference]: With dead ends: 46858 [2024-11-08 11:30:44,022 INFO L226 Difference]: Without dead ends: 25230 [2024-11-08 11:30:44,034 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-11-08 11:30:44,035 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 347 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:44,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 118 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:30:44,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25230 states. [2024-11-08 11:30:44,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25230 to 21926. [2024-11-08 11:30:44,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21926 states, 21925 states have (on average 1.024903078677309) internal successors, (22471), 21925 states have internal predecessors, (22471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:44,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21926 states to 21926 states and 22471 transitions. [2024-11-08 11:30:44,338 INFO L78 Accepts]: Start accepts. Automaton has 21926 states and 22471 transitions. Word has length 699 [2024-11-08 11:30:44,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:44,338 INFO L471 AbstractCegarLoop]: Abstraction has 21926 states and 22471 transitions. [2024-11-08 11:30:44,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:44,339 INFO L276 IsEmpty]: Start isEmpty. Operand 21926 states and 22471 transitions. [2024-11-08 11:30:44,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 720 [2024-11-08 11:30:44,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:44,345 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 11:30:44,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 11:30:44,345 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:44,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:44,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1173180747, now seen corresponding path program 1 times [2024-11-08 11:30:44,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:44,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856971922] [2024-11-08 11:30:44,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:44,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:44,801 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 498 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2024-11-08 11:30:44,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:44,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856971922] [2024-11-08 11:30:44,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856971922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:44,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:44,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:30:44,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100961383] [2024-11-08 11:30:44,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:44,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:30:44,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:44,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:30:44,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:30:44,803 INFO L87 Difference]: Start difference. First operand 21926 states and 22471 transitions. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 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-11-08 11:30:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:45,935 INFO L93 Difference]: Finished difference Result 51644 states and 52916 transitions. [2024-11-08 11:30:45,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:30:45,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 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) Word has length 719 [2024-11-08 11:30:45,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:45,959 INFO L225 Difference]: With dead ends: 51644 [2024-11-08 11:30:45,960 INFO L226 Difference]: Without dead ends: 30019 [2024-11-08 11:30:45,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:30:45,973 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 523 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1560 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:45,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 153 Invalid, 1692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1560 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:30:45,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30019 states. [2024-11-08 11:30:46,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30019 to 27323. [2024-11-08 11:30:46,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27323 states, 27322 states have (on average 1.0249249688895397) internal successors, (28003), 27322 states have internal predecessors, (28003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:46,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27323 states to 27323 states and 28003 transitions. [2024-11-08 11:30:46,324 INFO L78 Accepts]: Start accepts. Automaton has 27323 states and 28003 transitions. Word has length 719 [2024-11-08 11:30:46,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:46,325 INFO L471 AbstractCegarLoop]: Abstraction has 27323 states and 28003 transitions. [2024-11-08 11:30:46,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 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-11-08 11:30:46,325 INFO L276 IsEmpty]: Start isEmpty. Operand 27323 states and 28003 transitions. [2024-11-08 11:30:46,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2024-11-08 11:30:46,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:46,339 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 11:30:46,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 11:30:46,340 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:46,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:46,340 INFO L85 PathProgramCache]: Analyzing trace with hash 359955969, now seen corresponding path program 1 times [2024-11-08 11:30:46,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:46,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529213344] [2024-11-08 11:30:46,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:46,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:46,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1294 backedges. 930 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 11:30:46,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:46,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529213344] [2024-11-08 11:30:46,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529213344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:46,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:46,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:30:46,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719974907] [2024-11-08 11:30:46,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:46,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:30:46,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:46,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:30:46,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:30:46,869 INFO L87 Difference]: Start difference. First operand 27323 states and 28003 transitions. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:48,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:48,209 INFO L93 Difference]: Finished difference Result 60035 states and 61515 transitions. [2024-11-08 11:30:48,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:30:48,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 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 778 [2024-11-08 11:30:48,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:48,240 INFO L225 Difference]: With dead ends: 60035 [2024-11-08 11:30:48,240 INFO L226 Difference]: Without dead ends: 33013 [2024-11-08 11:30:48,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:30:48,259 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 533 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:48,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 171 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 11:30:48,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33013 states. [2024-11-08 11:30:48,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33013 to 27323. [2024-11-08 11:30:48,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27323 states, 27322 states have (on average 1.0249249688895397) internal successors, (28003), 27322 states have internal predecessors, (28003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27323 states to 27323 states and 28003 transitions. [2024-11-08 11:30:48,516 INFO L78 Accepts]: Start accepts. Automaton has 27323 states and 28003 transitions. Word has length 778 [2024-11-08 11:30:48,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:48,517 INFO L471 AbstractCegarLoop]: Abstraction has 27323 states and 28003 transitions. [2024-11-08 11:30:48,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:48,517 INFO L276 IsEmpty]: Start isEmpty. Operand 27323 states and 28003 transitions. [2024-11-08 11:30:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2024-11-08 11:30:48,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:48,534 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:30:48,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 11:30:48,534 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:48,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:48,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1524543446, now seen corresponding path program 1 times [2024-11-08 11:30:48,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:48,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021704186] [2024-11-08 11:30:48,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:48,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:49,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2024-11-08 11:30:49,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:49,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021704186] [2024-11-08 11:30:49,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021704186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:49,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:49,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:30:49,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777458881] [2024-11-08 11:30:49,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:49,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:49,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:49,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:49,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:49,347 INFO L87 Difference]: Start difference. First operand 27323 states and 28003 transitions. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:50,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:50,241 INFO L93 Difference]: Finished difference Result 45626 states and 46720 transitions. [2024-11-08 11:30:50,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:50,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 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 786 [2024-11-08 11:30:50,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:50,254 INFO L225 Difference]: With dead ends: 45626 [2024-11-08 11:30:50,254 INFO L226 Difference]: Without dead ends: 18604 [2024-11-08 11:30:50,262 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-11-08 11:30:50,264 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 216 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:50,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 358 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:30:50,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18604 states. [2024-11-08 11:30:50,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18604 to 15909. [2024-11-08 11:30:50,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15909 states, 15908 states have (on average 1.0208071410611013) internal successors, (16239), 15908 states have internal predecessors, (16239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15909 states to 15909 states and 16239 transitions. [2024-11-08 11:30:50,397 INFO L78 Accepts]: Start accepts. Automaton has 15909 states and 16239 transitions. Word has length 786 [2024-11-08 11:30:50,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:50,398 INFO L471 AbstractCegarLoop]: Abstraction has 15909 states and 16239 transitions. [2024-11-08 11:30:50,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:50,398 INFO L276 IsEmpty]: Start isEmpty. Operand 15909 states and 16239 transitions. [2024-11-08 11:30:50,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 825 [2024-11-08 11:30:50,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:50,412 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:30:50,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 11:30:50,412 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:50,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:50,413 INFO L85 PathProgramCache]: Analyzing trace with hash -594814793, now seen corresponding path program 1 times [2024-11-08 11:30:50,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:50,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966830066] [2024-11-08 11:30:50,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:50,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:50,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 519 proven. 0 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2024-11-08 11:30:50,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:50,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966830066] [2024-11-08 11:30:50,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966830066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:50,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:50,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:30:50,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665354090] [2024-11-08 11:30:50,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:50,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:50,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:50,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:50,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:50,833 INFO L87 Difference]: Start difference. First operand 15909 states and 16239 transitions. Second operand has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:51,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:51,507 INFO L93 Difference]: Finished difference Result 32413 states and 33083 transitions. [2024-11-08 11:30:51,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:51,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 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 824 [2024-11-08 11:30:51,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:51,522 INFO L225 Difference]: With dead ends: 32413 [2024-11-08 11:30:51,522 INFO L226 Difference]: Without dead ends: 16805 [2024-11-08 11:30:51,530 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-11-08 11:30:51,531 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 308 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:51,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 418 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:30:51,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16805 states. [2024-11-08 11:30:51,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16805 to 15609. [2024-11-08 11:30:51,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15609 states, 15608 states have (on average 1.0206304459251665) internal successors, (15930), 15608 states have internal predecessors, (15930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15609 states to 15609 states and 15930 transitions. [2024-11-08 11:30:51,663 INFO L78 Accepts]: Start accepts. Automaton has 15609 states and 15930 transitions. Word has length 824 [2024-11-08 11:30:51,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:51,664 INFO L471 AbstractCegarLoop]: Abstraction has 15609 states and 15930 transitions. [2024-11-08 11:30:51,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:51,664 INFO L276 IsEmpty]: Start isEmpty. Operand 15609 states and 15930 transitions. [2024-11-08 11:30:51,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2024-11-08 11:30:51,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:51,673 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:30:51,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 11:30:51,674 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:51,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:51,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1707436180, now seen corresponding path program 1 times [2024-11-08 11:30:51,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:51,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061474049] [2024-11-08 11:30:51,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:51,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:52,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1123 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 1004 trivial. 0 not checked. [2024-11-08 11:30:52,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:52,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061474049] [2024-11-08 11:30:52,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061474049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:52,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:52,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:30:52,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288313999] [2024-11-08 11:30:52,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:52,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:52,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:52,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:52,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:52,156 INFO L87 Difference]: Start difference. First operand 15609 states and 15930 transitions. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:52,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:52,915 INFO L93 Difference]: Finished difference Result 36314 states and 37068 transitions. [2024-11-08 11:30:52,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:52,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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 835 [2024-11-08 11:30:52,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:52,934 INFO L225 Difference]: With dead ends: 36314 [2024-11-08 11:30:52,934 INFO L226 Difference]: Without dead ends: 20707 [2024-11-08 11:30:52,942 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-11-08 11:30:52,943 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 292 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:52,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 409 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:30:52,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20707 states. [2024-11-08 11:30:53,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20707 to 18902. [2024-11-08 11:30:53,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18902 states, 18901 states have (on average 1.0207396434051108) internal successors, (19293), 18901 states have internal predecessors, (19293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:53,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18902 states to 18902 states and 19293 transitions. [2024-11-08 11:30:53,118 INFO L78 Accepts]: Start accepts. Automaton has 18902 states and 19293 transitions. Word has length 835 [2024-11-08 11:30:53,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:53,119 INFO L471 AbstractCegarLoop]: Abstraction has 18902 states and 19293 transitions. [2024-11-08 11:30:53,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 18902 states and 19293 transitions. [2024-11-08 11:30:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 861 [2024-11-08 11:30:53,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:53,129 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:30:53,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 11:30:53,129 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:53,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:53,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1751874221, now seen corresponding path program 1 times [2024-11-08 11:30:53,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:53,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015236369] [2024-11-08 11:30:53,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:53,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:53,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2024-11-08 11:30:53,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:53,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015236369] [2024-11-08 11:30:53,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015236369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:53,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:53,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:30:53,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682799888] [2024-11-08 11:30:53,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:53,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:53,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:53,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:53,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:53,574 INFO L87 Difference]: Start difference. First operand 18902 states and 19293 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:54,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:54,215 INFO L93 Difference]: Finished difference Result 37501 states and 38288 transitions. [2024-11-08 11:30:54,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:54,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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 860 [2024-11-08 11:30:54,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:54,233 INFO L225 Difference]: With dead ends: 37501 [2024-11-08 11:30:54,233 INFO L226 Difference]: Without dead ends: 18601 [2024-11-08 11:30:54,244 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-11-08 11:30:54,245 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 294 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:54,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 398 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:30:54,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18601 states. [2024-11-08 11:30:54,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18601 to 14398. [2024-11-08 11:30:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14398 states, 14397 states have (on average 1.016739598527471) internal successors, (14638), 14397 states have internal predecessors, (14638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:54,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14398 states to 14398 states and 14638 transitions. [2024-11-08 11:30:54,378 INFO L78 Accepts]: Start accepts. Automaton has 14398 states and 14638 transitions. Word has length 860 [2024-11-08 11:30:54,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:54,379 INFO L471 AbstractCegarLoop]: Abstraction has 14398 states and 14638 transitions. [2024-11-08 11:30:54,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:54,379 INFO L276 IsEmpty]: Start isEmpty. Operand 14398 states and 14638 transitions. [2024-11-08 11:30:54,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 943 [2024-11-08 11:30:54,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:30:54,389 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:30:54,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 11:30:54,389 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:30:54,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:30:54,390 INFO L85 PathProgramCache]: Analyzing trace with hash 2095587486, now seen corresponding path program 1 times [2024-11-08 11:30:54,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:30:54,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037238722] [2024-11-08 11:30:54,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:30:54,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:30:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:30:54,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1524 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2024-11-08 11:30:54,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:30:54,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037238722] [2024-11-08 11:30:54,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037238722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:30:54,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:30:54,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:30:54,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236924986] [2024-11-08 11:30:54,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:30:54,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:30:54,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:30:54,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:30:54,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:30:54,954 INFO L87 Difference]: Start difference. First operand 14398 states and 14638 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:55,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:30:55,631 INFO L93 Difference]: Finished difference Result 30291 states and 30797 transitions. [2024-11-08 11:30:55,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:30:55,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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 942 [2024-11-08 11:30:55,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:30:55,633 INFO L225 Difference]: With dead ends: 30291 [2024-11-08 11:30:55,633 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:30:55,642 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-11-08 11:30:55,643 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 274 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:30:55,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 414 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:30:55,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:30:55,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:30:55,644 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-11-08 11:30:55,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:30:55,644 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 942 [2024-11-08 11:30:55,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:30:55,644 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:30:55,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:30:55,645 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:30:55,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:30:55,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:30:55,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 11:30:55,649 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:30:55,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:31:02,597 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:31:02,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:31:02 BoogieIcfgContainer [2024-11-08 11:31:02,626 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:31:02,627 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:31:02,627 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:31:02,627 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:31:02,627 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:30:00" (3/4) ... [2024-11-08 11:31:02,629 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:31:02,647 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-08 11:31:02,648 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:31:02,650 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:31:02,651 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:31:02,810 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:31:02,810 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:31:02,810 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:31:02,811 INFO L158 Benchmark]: Toolchain (without parser) took 65883.66ms. Allocated memory was 184.5MB in the beginning and 5.6GB in the end (delta: 5.5GB). Free memory was 128.4MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2024-11-08 11:31:02,811 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:31:02,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 727.53ms. Allocated memory is still 184.5MB. Free memory was 128.4MB in the beginning and 137.0MB in the end (delta: -8.6MB). Peak memory consumption was 94.2MB. Max. memory is 16.1GB. [2024-11-08 11:31:02,811 INFO L158 Benchmark]: Boogie Procedure Inliner took 133.16ms. Allocated memory is still 184.5MB. Free memory was 137.0MB in the beginning and 99.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-08 11:31:02,812 INFO L158 Benchmark]: Boogie Preprocessor took 251.22ms. Allocated memory is still 184.5MB. Free memory was 99.3MB in the beginning and 100.4MB in the end (delta: -1.1MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. [2024-11-08 11:31:02,813 INFO L158 Benchmark]: RCFGBuilder took 1984.97ms. Allocated memory was 184.5MB in the beginning and 339.7MB in the end (delta: 155.2MB). Free memory was 100.4MB in the beginning and 229.0MB in the end (delta: -128.6MB). Peak memory consumption was 130.4MB. Max. memory is 16.1GB. [2024-11-08 11:31:02,813 INFO L158 Benchmark]: TraceAbstraction took 62597.01ms. Allocated memory was 339.7MB in the beginning and 5.6GB in the end (delta: 5.3GB). Free memory was 228.0MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. [2024-11-08 11:31:02,813 INFO L158 Benchmark]: Witness Printer took 183.99ms. Allocated memory is still 5.6GB. Free memory was 2.8GB in the beginning and 2.8GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-08 11:31:02,815 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 184.5MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 727.53ms. Allocated memory is still 184.5MB. Free memory was 128.4MB in the beginning and 137.0MB in the end (delta: -8.6MB). Peak memory consumption was 94.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 133.16ms. Allocated memory is still 184.5MB. Free memory was 137.0MB in the beginning and 99.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 251.22ms. Allocated memory is still 184.5MB. Free memory was 99.3MB in the beginning and 100.4MB in the end (delta: -1.1MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1984.97ms. Allocated memory was 184.5MB in the beginning and 339.7MB in the end (delta: 155.2MB). Free memory was 100.4MB in the beginning and 229.0MB in the end (delta: -128.6MB). Peak memory consumption was 130.4MB. Max. memory is 16.1GB. * TraceAbstraction took 62597.01ms. Allocated memory was 339.7MB in the beginning and 5.6GB in the end (delta: 5.3GB). Free memory was 228.0MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. * Witness Printer took 183.99ms. Allocated memory is still 5.6GB. Free memory was 2.8GB in the beginning and 2.8GB in the end (delta: 27.3MB). 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: 113]: 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, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.5s, OverallIterations: 27, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 35.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11361 SdHoareTripleChecker+Valid, 32.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11361 mSDsluCounter, 10406 SdHoareTripleChecker+Invalid, 27.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1027 mSDsCounter, 4441 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28804 IncrementalHoareTripleChecker+Invalid, 33245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4441 mSolverCounterUnsat, 9379 mSDtfsCounter, 28804 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3524 GetRequests, 3469 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27323occurred in iteration=21, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 44139 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 17116 NumberOfCodeBlocks, 17116 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 17739 ConstructedInterpolants, 0 QuantifiedInterpolants, 39923 SizeOfPredicates, 5 NumberOfNonLiveVariables, 3437 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 33 InterpolantComputations, 26 PerfectInterpolantSequences, 20314/20683 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: 1776]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((long long) 89 + a4) <= 0) && (((long long) a0 + 3672) <= 0)) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a0 + 61) <= 0))) || ((((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (0 <= ((long long) 599998 + a0))) && (a2 == 4))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && (3 == a2))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) 599998 + a0))) && (((long long) a0 + 147) <= 0)) && (5 <= a2))) || ((((((long long) 104 + a0) <= 0) && (2 <= a29)) && (((long long) 89 + a4) <= 0)) && (3 == a2))) || (((((long long) 89 + a4) <= 0) && (a2 == 4)) && (a29 <= 43))) || (((2 == a2) && (44 <= a29)) && (((long long) a0 + 147) <= 0))) || ((((((0 <= ((long long) 140 + a0)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 73))) && (3 == a2)) || (((((0 <= ((long long) 140 + a0)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (3 == a2))) && (((long long) 98 + a0) <= 0))) || (((44 <= a29) && (((long long) 89 + a4) <= 0)) && (3 == a2))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 1))) || ((2 == a2) && (((long long) 89 + a4) <= 0))) || ((((((long long) 42 + a4) <= 0) && (3 == a2)) && (((long long) a0 + 3672) <= 0)) && (a29 <= 43))) || ((((((long long) 42 + a4) <= 0) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && (a2 == 1))) || (((((long long) a29 + 145) <= 0) && (((long long) 89 + a4) <= 0)) && (3 == a2))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) 599998 + a0))) && (a2 == 4)) && (((long long) a0 + 3672) <= 0))) || (((0 <= ((long long) 97 + a0)) && (((long long) 89 + a4) <= 0)) && (3 == a2))) || (((((long long) 89 + a4) <= 0) && (a2 == 4)) && (((long long) a0 + 61) <= 0))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (5 <= a2))) || (((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (3 == a2)) && (a29 <= 43))) || (((0 <= ((long long) 599998 + a0)) && ((((((long long) 42 + a4) <= 0) && (a2 == 1)) && (((long long) a0 + 61) <= 0)) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (a2 == 1)))) && (a29 <= 43))) || ((((((long long) 89 + a4) <= 0) && (a2 == 1)) && (0 <= ((long long) 44 + a0))) && (((long long) a29 + 127) == 0))) || (((((long long) 89 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (3 == a2))) || ((((long long) 89 + a4) <= 0) && (5 <= a2))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-08 11:31:02,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE