./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label16.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label16.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 138817afdbd1a5a2b63b2ff28887fed513cabb63a61c2da07343757c56a3cff4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:51:36,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:51:36,129 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:51:36,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:51:36,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:51:36,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:51:36,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:51:36,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:51:36,183 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:51:36,183 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:51:36,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:51:36,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:51:36,185 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:51:36,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:51:36,189 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:51:36,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:51:36,190 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:51:36,191 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:51:36,191 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:51:36,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:51:36,192 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:51:36,192 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:51:36,192 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:51:36,193 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:51:36,193 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:51:36,193 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:51:36,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:51:36,194 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:51:36,194 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:51:36,194 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:51:36,195 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:51:36,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:51:36,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:51:36,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:51:36,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:51:36,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:51:36,197 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:51:36,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:51:36,198 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:51:36,198 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:51:36,198 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:51:36,198 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:51:36,199 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 138817afdbd1a5a2b63b2ff28887fed513cabb63a61c2da07343757c56a3cff4 [2024-10-10 23:51:36,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:51:36,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:51:36,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:51:36,483 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:51:36,483 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:51:36,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label16.c [2024-10-10 23:51:37,957 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:51:38,372 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:51:38,373 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label16.c [2024-10-10 23:51:38,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/56ac63e09/5de98889b45b4152bd64c8a91dfab37c/FLAGb2893ae6a [2024-10-10 23:51:38,416 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/56ac63e09/5de98889b45b4152bd64c8a91dfab37c [2024-10-10 23:51:38,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:51:38,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:51:38,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:51:38,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:51:38,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:51:38,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:51:38" (1/1) ... [2024-10-10 23:51:38,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@558e0f87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:51:38, skipping insertion in model container [2024-10-10 23:51:38,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:51:38" (1/1) ... [2024-10-10 23:51:38,536 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:51:38,815 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label16.c[4934,4947] [2024-10-10 23:51:39,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:51:39,449 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:51:39,473 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label16.c[4934,4947] [2024-10-10 23:51:39,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:51:39,783 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:51:39,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:51:39 WrapperNode [2024-10-10 23:51:39,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:51:39,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:51:39,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:51:39,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:51:39,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:51:39" (1/1) ... [2024-10-10 23:51:39,841 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:51:39" (1/1) ... [2024-10-10 23:51:40,099 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4135 [2024-10-10 23:51:40,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:51:40,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:51:40,105 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:51:40,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:51:40,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:51:39" (1/1) ... [2024-10-10 23:51:40,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:51:39" (1/1) ... [2024-10-10 23:51:40,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:51:39" (1/1) ... [2024-10-10 23:51:40,233 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:51:40,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:51:39" (1/1) ... [2024-10-10 23:51:40,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:51:39" (1/1) ... [2024-10-10 23:51:40,311 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:51:39" (1/1) ... [2024-10-10 23:51:40,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:51:39" (1/1) ... [2024-10-10 23:51:40,351 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:51:39" (1/1) ... [2024-10-10 23:51:40,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:51:39" (1/1) ... [2024-10-10 23:51:40,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:51:40,466 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:51:40,466 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:51:40,466 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:51:40,467 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:51:39" (1/1) ... [2024-10-10 23:51:40,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:51:40,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:51:40,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:51:40,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:51:40,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:51:40,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:51:40,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:51:40,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:51:40,611 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:51:40,613 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:51:43,769 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2024-10-10 23:51:43,769 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:51:43,830 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:51:43,831 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:51:43,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:51:43 BoogieIcfgContainer [2024-10-10 23:51:43,831 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:51:43,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:51:43,834 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:51:43,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:51:43,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:51:38" (1/3) ... [2024-10-10 23:51:43,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377a51d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:51:43, skipping insertion in model container [2024-10-10 23:51:43,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:51:39" (2/3) ... [2024-10-10 23:51:43,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377a51d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:51:43, skipping insertion in model container [2024-10-10 23:51:43,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:51:43" (3/3) ... [2024-10-10 23:51:43,841 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label16.c [2024-10-10 23:51:43,858 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:51:43,859 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:51:43,946 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:51:43,953 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;@23dd688a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:51:43,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:51:43,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 695 states, 693 states have (on average 1.9942279942279941) internal successors, (1382), 694 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:51:43,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-10 23:51:43,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:51:43,969 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:51:43,970 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:51:43,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:51:43,974 INFO L85 PathProgramCache]: Analyzing trace with hash 708214475, now seen corresponding path program 1 times [2024-10-10 23:51:43,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:51:43,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123428554] [2024-10-10 23:51:43,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:51:43,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:51:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:51:44,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:51:44,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:51:44,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123428554] [2024-10-10 23:51:44,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123428554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:51:44,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:51:44,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:51:44,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895186311] [2024-10-10 23:51:44,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:51:44,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:51:44,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:51:44,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:51:44,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:51:44,226 INFO L87 Difference]: Start difference. First operand has 695 states, 693 states have (on average 1.9942279942279941) internal successors, (1382), 694 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:51:44,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:51:44,319 INFO L93 Difference]: Finished difference Result 1389 states and 2763 transitions. [2024-10-10 23:51:44,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:51:44,329 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2024-10-10 23:51:44,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:51:44,344 INFO L225 Difference]: With dead ends: 1389 [2024-10-10 23:51:44,345 INFO L226 Difference]: Without dead ends: 693 [2024-10-10 23:51:44,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:51:44,352 INFO L432 NwaCegarLoop]: 1317 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:51:44,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1317 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:51:44,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-10-10 23:51:44,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2024-10-10 23:51:44,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.903179190751445) internal successors, (1317), 692 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:51:44,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1317 transitions. [2024-10-10 23:51:44,436 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1317 transitions. Word has length 45 [2024-10-10 23:51:44,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:51:44,437 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 1317 transitions. [2024-10-10 23:51:44,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:51:44,437 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1317 transitions. [2024-10-10 23:51:44,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-10 23:51:44,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:51:44,439 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:51:44,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:51:44,440 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:51:44,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:51:44,441 INFO L85 PathProgramCache]: Analyzing trace with hash -129468155, now seen corresponding path program 1 times [2024-10-10 23:51:44,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:51:44,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219170187] [2024-10-10 23:51:44,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:51:44,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:51:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:51:44,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:51:44,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:51:44,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219170187] [2024-10-10 23:51:44,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219170187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:51:44,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:51:44,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:51:44,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166558376] [2024-10-10 23:51:44,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:51:44,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:51:44,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:51:44,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:51:44,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:51:44,676 INFO L87 Difference]: Start difference. First operand 693 states and 1317 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:51:47,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:51:47,743 INFO L93 Difference]: Finished difference Result 2075 states and 3948 transitions. [2024-10-10 23:51:47,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:51:47,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2024-10-10 23:51:47,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:51:47,750 INFO L225 Difference]: With dead ends: 2075 [2024-10-10 23:51:47,750 INFO L226 Difference]: Without dead ends: 1383 [2024-10-10 23:51:47,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:51:47,752 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 730 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 2667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:51:47,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 435 Invalid, 2667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 1994 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-10 23:51:47,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-10-10 23:51:47,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1383. [2024-10-10 23:51:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1382 states have (on average 1.5998552821997105) internal successors, (2211), 1382 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:51:47,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2211 transitions. [2024-10-10 23:51:47,801 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 2211 transitions. Word has length 45 [2024-10-10 23:51:47,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:51:47,801 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 2211 transitions. [2024-10-10 23:51:47,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:51:47,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2211 transitions. [2024-10-10 23:51:47,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-10 23:51:47,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:51:47,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, 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] [2024-10-10 23:51:47,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:51:47,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:51:47,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:51:47,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1425047489, now seen corresponding path program 1 times [2024-10-10 23:51:47,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:51:47,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892188536] [2024-10-10 23:51:47,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:51:47,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:51:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:51:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:51:48,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:51:48,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892188536] [2024-10-10 23:51:48,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892188536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:51:48,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:51:48,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:51:48,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438581538] [2024-10-10 23:51:48,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:51:48,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:51:48,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:51:48,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:51:48,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:51:48,009 INFO L87 Difference]: Start difference. First operand 1383 states and 2211 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:51:50,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:51:50,771 INFO L93 Difference]: Finished difference Result 4145 states and 6630 transitions. [2024-10-10 23:51:50,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:51:50,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2024-10-10 23:51:50,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:51:50,781 INFO L225 Difference]: With dead ends: 4145 [2024-10-10 23:51:50,782 INFO L226 Difference]: Without dead ends: 2763 [2024-10-10 23:51:50,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:51:50,785 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 714 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 2620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:51:50,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 527 Invalid, 2620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1702 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:51:50,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2024-10-10 23:51:50,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2763. [2024-10-10 23:51:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.3504706734250542) internal successors, (3730), 2762 states have internal predecessors, (3730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:51:50,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 3730 transitions. [2024-10-10 23:51:50,848 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 3730 transitions. Word has length 110 [2024-10-10 23:51:50,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:51:50,850 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 3730 transitions. [2024-10-10 23:51:50,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:51:50,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 3730 transitions. [2024-10-10 23:51:50,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-10 23:51:50,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:51:50,856 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:51:50,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:51:50,856 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:51:50,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:51:50,857 INFO L85 PathProgramCache]: Analyzing trace with hash -623078216, now seen corresponding path program 1 times [2024-10-10 23:51:50,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:51:50,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451342795] [2024-10-10 23:51:50,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:51:50,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:51:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:51:51,623 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-10 23:51:51,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:51:51,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451342795] [2024-10-10 23:51:51,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451342795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:51:51,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:51:51,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:51:51,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921601349] [2024-10-10 23:51:51,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:51:51,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:51:51,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:51:51,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:51:51,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:51:51,630 INFO L87 Difference]: Start difference. First operand 2763 states and 3730 transitions. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:51:54,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:51:54,854 INFO L93 Difference]: Finished difference Result 6905 states and 9073 transitions. [2024-10-10 23:51:54,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:51:54,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 228 [2024-10-10 23:51:54,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:51:54,871 INFO L225 Difference]: With dead ends: 6905 [2024-10-10 23:51:54,871 INFO L226 Difference]: Without dead ends: 4143 [2024-10-10 23:51:54,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:51:54,877 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 1873 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4085 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 4275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 4085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:51:54,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1873 Valid, 638 Invalid, 4275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 4085 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:51:54,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4143 states. [2024-10-10 23:51:54,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4143 to 4143. [2024-10-10 23:51:54,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4143 states, 4142 states have (on average 1.2467407049734427) internal successors, (5164), 4142 states have internal predecessors, (5164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:51:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 5164 transitions. [2024-10-10 23:51:54,954 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 5164 transitions. Word has length 228 [2024-10-10 23:51:54,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:51:54,955 INFO L471 AbstractCegarLoop]: Abstraction has 4143 states and 5164 transitions. [2024-10-10 23:51:54,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:51:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 5164 transitions. [2024-10-10 23:51:54,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-10-10 23:51:54,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:51:54,965 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:51:54,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:51:54,965 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:51:54,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:51:54,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1817461301, now seen corresponding path program 1 times [2024-10-10 23:51:54,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:51:54,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199355032] [2024-10-10 23:51:54,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:51:54,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:51:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:51:55,472 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-10 23:51:55,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:51:55,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199355032] [2024-10-10 23:51:55,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199355032] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:51:55,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129181756] [2024-10-10 23:51:55,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:51:55,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:51:55,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:51:55,479 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:51:55,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:51:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:51:55,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:51:55,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:51:56,137 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-10 23:51:56,137 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:51:56,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129181756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:51:56,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:51:56,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 23:51:56,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066667774] [2024-10-10 23:51:56,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:51:56,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:51:56,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:51:56,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:51:56,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:51:56,140 INFO L87 Difference]: Start difference. First operand 4143 states and 5164 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:51:58,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:51:58,497 INFO L93 Difference]: Finished difference Result 11045 states and 14055 transitions. [2024-10-10 23:51:58,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:51:58,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 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 344 [2024-10-10 23:51:58,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:51:58,519 INFO L225 Difference]: With dead ends: 11045 [2024-10-10 23:51:58,520 INFO L226 Difference]: Without dead ends: 6903 [2024-10-10 23:51:58,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:51:58,526 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 398 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2332 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 2332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:51:58,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 548 Invalid, 2789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 2332 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:51:58,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6903 states. [2024-10-10 23:51:58,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6903 to 6213. [2024-10-10 23:51:58,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6213 states, 6212 states have (on average 1.2398583386992916) internal successors, (7702), 6212 states have internal predecessors, (7702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:51:58,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 7702 transitions. [2024-10-10 23:51:58,630 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 7702 transitions. Word has length 344 [2024-10-10 23:51:58,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:51:58,633 INFO L471 AbstractCegarLoop]: Abstraction has 6213 states and 7702 transitions. [2024-10-10 23:51:58,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:51:58,634 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 7702 transitions. [2024-10-10 23:51:58,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2024-10-10 23:51:58,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:51:58,640 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:51:58,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:51:58,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:51:58,842 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:51:58,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:51:58,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1790735353, now seen corresponding path program 1 times [2024-10-10 23:51:58,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:51:58,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517371332] [2024-10-10 23:51:58,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:51:58,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:51:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:51:59,403 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-10 23:51:59,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:51:59,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517371332] [2024-10-10 23:51:59,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517371332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:51:59,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:51:59,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:51:59,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157273743] [2024-10-10 23:51:59,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:51:59,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:51:59,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:51:59,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:51:59,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:51:59,410 INFO L87 Difference]: Start difference. First operand 6213 states and 7702 transitions. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:01,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:52:01,960 INFO L93 Difference]: Finished difference Result 13858 states and 16878 transitions. [2024-10-10 23:52:01,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:52:01,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 414 [2024-10-10 23:52:01,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:52:01,988 INFO L225 Difference]: With dead ends: 13858 [2024-10-10 23:52:01,988 INFO L226 Difference]: Without dead ends: 7593 [2024-10-10 23:52:01,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:52:01,996 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 513 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3038 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 3240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 3038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:52:01,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 637 Invalid, 3240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 3038 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:52:02,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7593 states. [2024-10-10 23:52:02,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7593 to 7593. [2024-10-10 23:52:02,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7593 states, 7592 states have (on average 1.1513435194942043) internal successors, (8741), 7592 states have internal predecessors, (8741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:02,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7593 states to 7593 states and 8741 transitions. [2024-10-10 23:52:02,114 INFO L78 Accepts]: Start accepts. Automaton has 7593 states and 8741 transitions. Word has length 414 [2024-10-10 23:52:02,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:52:02,114 INFO L471 AbstractCegarLoop]: Abstraction has 7593 states and 8741 transitions. [2024-10-10 23:52:02,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:02,115 INFO L276 IsEmpty]: Start isEmpty. Operand 7593 states and 8741 transitions. [2024-10-10 23:52:02,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2024-10-10 23:52:02,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:52:02,121 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:52:02,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:52:02,121 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:52:02,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:52:02,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1716268253, now seen corresponding path program 1 times [2024-10-10 23:52:02,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:52:02,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112834421] [2024-10-10 23:52:02,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:52:02,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:52:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:52:02,471 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-10 23:52:02,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:52:02,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112834421] [2024-10-10 23:52:02,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112834421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:52:02,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:52:02,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:52:02,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156338075] [2024-10-10 23:52:02,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:52:02,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:52:02,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:52:02,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:52:02,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:52:02,476 INFO L87 Difference]: Start difference. First operand 7593 states and 8741 transitions. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 2 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:04,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:52:04,410 INFO L93 Difference]: Finished difference Result 18635 states and 21310 transitions. [2024-10-10 23:52:04,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:52:04,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 2 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 429 [2024-10-10 23:52:04,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:52:04,440 INFO L225 Difference]: With dead ends: 18635 [2024-10-10 23:52:04,440 INFO L226 Difference]: Without dead ends: 11043 [2024-10-10 23:52:04,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:52:04,452 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 398 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 2077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:52:04,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 424 Invalid, 2077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1945 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:52:04,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11043 states. [2024-10-10 23:52:04,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11043 to 11043. [2024-10-10 23:52:04,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11043 states, 11042 states have (on average 1.1249773591740626) internal successors, (12422), 11042 states have internal predecessors, (12422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:04,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11043 states to 11043 states and 12422 transitions. [2024-10-10 23:52:04,629 INFO L78 Accepts]: Start accepts. Automaton has 11043 states and 12422 transitions. Word has length 429 [2024-10-10 23:52:04,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:52:04,630 INFO L471 AbstractCegarLoop]: Abstraction has 11043 states and 12422 transitions. [2024-10-10 23:52:04,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 2 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:04,630 INFO L276 IsEmpty]: Start isEmpty. Operand 11043 states and 12422 transitions. [2024-10-10 23:52:04,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2024-10-10 23:52:04,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:52:04,638 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:52:04,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:52:04,638 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:52:04,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:52:04,639 INFO L85 PathProgramCache]: Analyzing trace with hash 471858377, now seen corresponding path program 1 times [2024-10-10 23:52:04,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:52:04,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965228171] [2024-10-10 23:52:04,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:52:04,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:52:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:52:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:52:05,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:52:05,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965228171] [2024-10-10 23:52:05,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965228171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:52:05,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:52:05,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:52:05,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881728069] [2024-10-10 23:52:05,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:52:05,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:52:05,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:52:05,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:52:05,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:52:05,202 INFO L87 Difference]: Start difference. First operand 11043 states and 12422 transitions. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:07,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:52:07,010 INFO L93 Difference]: Finished difference Result 30365 states and 34441 transitions. [2024-10-10 23:52:07,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:52:07,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 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 437 [2024-10-10 23:52:07,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:52:07,045 INFO L225 Difference]: With dead ends: 30365 [2024-10-10 23:52:07,045 INFO L226 Difference]: Without dead ends: 19323 [2024-10-10 23:52:07,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:52:07,060 INFO L432 NwaCegarLoop]: 970 mSDtfsCounter, 601 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1956 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 2305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:52:07,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 975 Invalid, 2305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1956 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:52:07,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19323 states. [2024-10-10 23:52:07,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19323 to 18633. [2024-10-10 23:52:07,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18633 states, 18632 states have (on average 1.1019214255045084) internal successors, (20531), 18632 states have internal predecessors, (20531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18633 states to 18633 states and 20531 transitions. [2024-10-10 23:52:07,286 INFO L78 Accepts]: Start accepts. Automaton has 18633 states and 20531 transitions. Word has length 437 [2024-10-10 23:52:07,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:52:07,287 INFO L471 AbstractCegarLoop]: Abstraction has 18633 states and 20531 transitions. [2024-10-10 23:52:07,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:07,288 INFO L276 IsEmpty]: Start isEmpty. Operand 18633 states and 20531 transitions. [2024-10-10 23:52:07,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2024-10-10 23:52:07,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:52:07,291 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:52:07,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:52:07,291 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:52:07,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:52:07,292 INFO L85 PathProgramCache]: Analyzing trace with hash 959859718, now seen corresponding path program 1 times [2024-10-10 23:52:07,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:52:07,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487957761] [2024-10-10 23:52:07,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:52:07,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:52:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:52:07,633 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-10-10 23:52:07,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:52:07,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487957761] [2024-10-10 23:52:07,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487957761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:52:07,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:52:07,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:52:07,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229264339] [2024-10-10 23:52:07,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:52:07,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:52:07,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:52:07,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:52:07,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:52:07,639 INFO L87 Difference]: Start difference. First operand 18633 states and 20531 transitions. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:09,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:52:09,714 INFO L93 Difference]: Finished difference Result 43475 states and 48493 transitions. [2024-10-10 23:52:09,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:52:09,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 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 444 [2024-10-10 23:52:09,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:52:09,773 INFO L225 Difference]: With dead ends: 43475 [2024-10-10 23:52:09,773 INFO L226 Difference]: Without dead ends: 25533 [2024-10-10 23:52:09,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:52:09,796 INFO L432 NwaCegarLoop]: 1146 mSDtfsCounter, 647 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 2368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:52:09,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 1152 Invalid, 2368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 1889 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:52:09,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25533 states. [2024-10-10 23:52:10,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25533 to 24843. [2024-10-10 23:52:10,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24843 states, 24842 states have (on average 1.094597858465502) internal successors, (27192), 24842 states have internal predecessors, (27192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:10,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24843 states to 24843 states and 27192 transitions. [2024-10-10 23:52:10,224 INFO L78 Accepts]: Start accepts. Automaton has 24843 states and 27192 transitions. Word has length 444 [2024-10-10 23:52:10,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:52:10,225 INFO L471 AbstractCegarLoop]: Abstraction has 24843 states and 27192 transitions. [2024-10-10 23:52:10,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:10,226 INFO L276 IsEmpty]: Start isEmpty. Operand 24843 states and 27192 transitions. [2024-10-10 23:52:10,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2024-10-10 23:52:10,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:52:10,232 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:52:10,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:52:10,234 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:52:10,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:52:10,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1558966785, now seen corresponding path program 1 times [2024-10-10 23:52:10,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:52:10,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146470666] [2024-10-10 23:52:10,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:52:10,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:52:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:52:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-10-10 23:52:11,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:52:11,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146470666] [2024-10-10 23:52:11,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146470666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:52:11,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:52:11,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:52:11,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758594592] [2024-10-10 23:52:11,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:52:11,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:52:11,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:52:11,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:52:11,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:52:11,069 INFO L87 Difference]: Start difference. First operand 24843 states and 27192 transitions. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:12,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:52:12,752 INFO L93 Difference]: Finished difference Result 48995 states and 53690 transitions. [2024-10-10 23:52:12,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:52:12,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 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 469 [2024-10-10 23:52:12,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:52:12,783 INFO L225 Difference]: With dead ends: 48995 [2024-10-10 23:52:12,783 INFO L226 Difference]: Without dead ends: 24843 [2024-10-10 23:52:12,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:52:12,805 INFO L432 NwaCegarLoop]: 771 mSDtfsCounter, 751 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 2166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:52:12,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 777 Invalid, 2166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:52:12,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24843 states. [2024-10-10 23:52:13,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24843 to 24843. [2024-10-10 23:52:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24843 states, 24842 states have (on average 1.0762418484824088) internal successors, (26736), 24842 states have internal predecessors, (26736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:13,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24843 states to 24843 states and 26736 transitions. [2024-10-10 23:52:13,091 INFO L78 Accepts]: Start accepts. Automaton has 24843 states and 26736 transitions. Word has length 469 [2024-10-10 23:52:13,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:52:13,092 INFO L471 AbstractCegarLoop]: Abstraction has 24843 states and 26736 transitions. [2024-10-10 23:52:13,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:13,092 INFO L276 IsEmpty]: Start isEmpty. Operand 24843 states and 26736 transitions. [2024-10-10 23:52:13,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2024-10-10 23:52:13,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:52:13,100 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:52:13,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:52:13,101 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:52:13,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:52:13,102 INFO L85 PathProgramCache]: Analyzing trace with hash 912249184, now seen corresponding path program 1 times [2024-10-10 23:52:13,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:52:13,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244486437] [2024-10-10 23:52:13,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:52:13,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:52:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:52:13,530 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 417 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-10-10 23:52:13,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:52:13,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244486437] [2024-10-10 23:52:13,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244486437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:52:13,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:52:13,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:52:13,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703155423] [2024-10-10 23:52:13,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:52:13,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:52:13,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:52:13,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:52:13,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:52:13,533 INFO L87 Difference]: Start difference. First operand 24843 states and 26736 transitions. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:15,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:52:15,442 INFO L93 Difference]: Finished difference Result 55205 states and 60039 transitions. [2024-10-10 23:52:15,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:52:15,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 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 587 [2024-10-10 23:52:15,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:52:15,483 INFO L225 Difference]: With dead ends: 55205 [2024-10-10 23:52:15,484 INFO L226 Difference]: Without dead ends: 28293 [2024-10-10 23:52:15,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:52:15,508 INFO L432 NwaCegarLoop]: 1088 mSDtfsCounter, 609 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1871 mSolverCounterSat, 428 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 2299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 428 IncrementalHoareTripleChecker+Valid, 1871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:52:15,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 1094 Invalid, 2299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [428 Valid, 1871 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:52:15,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28293 states. [2024-10-10 23:52:15,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28293 to 28293. [2024-10-10 23:52:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28293 states, 28292 states have (on average 1.0739431641453414) internal successors, (30384), 28292 states have internal predecessors, (30384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:15,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28293 states to 28293 states and 30384 transitions. [2024-10-10 23:52:15,955 INFO L78 Accepts]: Start accepts. Automaton has 28293 states and 30384 transitions. Word has length 587 [2024-10-10 23:52:15,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:52:15,955 INFO L471 AbstractCegarLoop]: Abstraction has 28293 states and 30384 transitions. [2024-10-10 23:52:15,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:15,956 INFO L276 IsEmpty]: Start isEmpty. Operand 28293 states and 30384 transitions. [2024-10-10 23:52:15,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2024-10-10 23:52:15,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:52:15,965 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:52:15,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:52:15,965 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:52:15,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:52:15,966 INFO L85 PathProgramCache]: Analyzing trace with hash 978541306, now seen corresponding path program 1 times [2024-10-10 23:52:15,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:52:15,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63132560] [2024-10-10 23:52:15,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:52:15,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:52:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:52:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 491 proven. 32 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-10-10 23:52:16,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:52:16,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63132560] [2024-10-10 23:52:16,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63132560] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:52:16,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572389115] [2024-10-10 23:52:16,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:52:16,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:52:16,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:52:16,749 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:52:16,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:52:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:52:17,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:52:17,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:52:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2024-10-10 23:52:17,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:52:17,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572389115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:52:17,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:52:17,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 23:52:17,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058931160] [2024-10-10 23:52:17,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:52:17,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:52:17,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:52:17,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:52:17,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:52:17,185 INFO L87 Difference]: Start difference. First operand 28293 states and 30384 transitions. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:19,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:52:19,286 INFO L93 Difference]: Finished difference Result 62105 states and 67212 transitions. [2024-10-10 23:52:19,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:52:19,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 623 [2024-10-10 23:52:19,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:52:19,324 INFO L225 Difference]: With dead ends: 62105 [2024-10-10 23:52:19,325 INFO L226 Difference]: Without dead ends: 33813 [2024-10-10 23:52:19,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 623 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:52:19,350 INFO L432 NwaCegarLoop]: 995 mSDtfsCounter, 657 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2066 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 2389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 2066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:52:19,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1001 Invalid, 2389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 2066 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:52:19,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33813 states. [2024-10-10 23:52:19,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33813 to 32433. [2024-10-10 23:52:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32433 states, 32432 states have (on average 1.0797360631475086) internal successors, (35018), 32432 states have internal predecessors, (35018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:19,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32433 states to 32433 states and 35018 transitions. [2024-10-10 23:52:19,863 INFO L78 Accepts]: Start accepts. Automaton has 32433 states and 35018 transitions. Word has length 623 [2024-10-10 23:52:19,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:52:19,864 INFO L471 AbstractCegarLoop]: Abstraction has 32433 states and 35018 transitions. [2024-10-10 23:52:19,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:19,864 INFO L276 IsEmpty]: Start isEmpty. Operand 32433 states and 35018 transitions. [2024-10-10 23:52:19,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 899 [2024-10-10 23:52:19,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:52:19,930 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:52:19,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:52:20,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:52:20,131 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:52:20,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:52:20,132 INFO L85 PathProgramCache]: Analyzing trace with hash -446891392, now seen corresponding path program 1 times [2024-10-10 23:52:20,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:52:20,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963353407] [2024-10-10 23:52:20,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:52:20,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:52:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:52:21,997 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 510 proven. 117 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-10 23:52:21,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:52:21,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963353407] [2024-10-10 23:52:21,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963353407] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:52:21,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609463548] [2024-10-10 23:52:21,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:52:21,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:52:22,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:52:22,001 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:52:22,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:52:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:52:22,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:52:22,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:52:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-10-10 23:52:22,734 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:52:22,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609463548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:52:22,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:52:22,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:52:22,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51505440] [2024-10-10 23:52:22,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:52:22,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:52:22,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:52:22,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:52:22,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:52:22,739 INFO L87 Difference]: Start difference. First operand 32433 states and 35018 transitions. Second operand has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:24,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:52:24,649 INFO L93 Difference]: Finished difference Result 75215 states and 82020 transitions. [2024-10-10 23:52:24,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:52:24,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 0 states have call successors, (0), 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 898 [2024-10-10 23:52:24,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:52:24,696 INFO L225 Difference]: With dead ends: 75215 [2024-10-10 23:52:24,696 INFO L226 Difference]: Without dead ends: 43473 [2024-10-10 23:52:24,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 902 GetRequests, 897 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:52:24,721 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 341 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1840 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 2289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 1840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:52:24,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 218 Invalid, 2289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 1840 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:52:24,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43473 states. [2024-10-10 23:52:25,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43473 to 43473. [2024-10-10 23:52:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43473 states, 43472 states have (on average 1.0783262789841737) internal successors, (46877), 43472 states have internal predecessors, (46877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:25,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43473 states to 43473 states and 46877 transitions. [2024-10-10 23:52:25,236 INFO L78 Accepts]: Start accepts. Automaton has 43473 states and 46877 transitions. Word has length 898 [2024-10-10 23:52:25,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:52:25,237 INFO L471 AbstractCegarLoop]: Abstraction has 43473 states and 46877 transitions. [2024-10-10 23:52:25,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:25,238 INFO L276 IsEmpty]: Start isEmpty. Operand 43473 states and 46877 transitions. [2024-10-10 23:52:25,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924 [2024-10-10 23:52:25,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:52:25,267 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:52:25,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-10 23:52:25,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:52:25,468 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:52:25,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:52:25,469 INFO L85 PathProgramCache]: Analyzing trace with hash -821116012, now seen corresponding path program 1 times [2024-10-10 23:52:25,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:52:25,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459607026] [2024-10-10 23:52:25,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:52:25,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:52:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:52:26,667 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 747 proven. 32 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-10-10 23:52:26,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:52:26,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459607026] [2024-10-10 23:52:26,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459607026] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:52:26,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384796435] [2024-10-10 23:52:26,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:52:26,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:52:26,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:52:26,671 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:52:26,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 23:52:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:52:26,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:52:26,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:52:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 668 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-10-10 23:52:27,334 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:52:27,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384796435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:52:27,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:52:27,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 23:52:27,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280653674] [2024-10-10 23:52:27,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:52:27,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:52:27,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:52:27,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:52:27,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:52:27,338 INFO L87 Difference]: Start difference. First operand 43473 states and 46877 transitions. Second operand has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:29,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:52:29,106 INFO L93 Difference]: Finished difference Result 86255 states and 93060 transitions. [2024-10-10 23:52:29,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:52:29,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 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 923 [2024-10-10 23:52:29,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:52:29,148 INFO L225 Difference]: With dead ends: 86255 [2024-10-10 23:52:29,148 INFO L226 Difference]: Without dead ends: 43473 [2024-10-10 23:52:29,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 926 GetRequests, 923 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:52:29,176 INFO L432 NwaCegarLoop]: 983 mSDtfsCounter, 374 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1810 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 1810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:52:29,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 989 Invalid, 2111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 1810 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:52:29,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43473 states. [2024-10-10 23:52:29,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43473 to 43473. [2024-10-10 23:52:29,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43473 states, 43472 states have (on average 1.0546788737578212) internal successors, (45849), 43472 states have internal predecessors, (45849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:29,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43473 states to 43473 states and 45849 transitions. [2024-10-10 23:52:29,587 INFO L78 Accepts]: Start accepts. Automaton has 43473 states and 45849 transitions. Word has length 923 [2024-10-10 23:52:29,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:52:29,588 INFO L471 AbstractCegarLoop]: Abstraction has 43473 states and 45849 transitions. [2024-10-10 23:52:29,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:29,588 INFO L276 IsEmpty]: Start isEmpty. Operand 43473 states and 45849 transitions. [2024-10-10 23:52:29,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 950 [2024-10-10 23:52:29,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:52:29,611 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:52:29,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-10 23:52:29,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-10 23:52:29,812 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:52:29,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:52:29,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1428825336, now seen corresponding path program 1 times [2024-10-10 23:52:29,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:52:29,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861629443] [2024-10-10 23:52:29,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:52:29,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:52:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:52:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 698 proven. 92 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-10-10 23:52:31,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:52:31,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861629443] [2024-10-10 23:52:31,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861629443] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:52:31,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294426208] [2024-10-10 23:52:31,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:52:31,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:52:31,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:52:31,412 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:52:31,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 23:52:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:52:31,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 1106 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:52:31,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:52:32,069 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2024-10-10 23:52:32,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:52:32,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294426208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:52:32,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:52:32,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:52:32,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595707467] [2024-10-10 23:52:32,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:52:32,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:52:32,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:52:32,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:52:32,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:52:32,074 INFO L87 Difference]: Start difference. First operand 43473 states and 45849 transitions. Second operand has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:34,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:52:34,054 INFO L93 Difference]: Finished difference Result 97295 states and 103205 transitions. [2024-10-10 23:52:34,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:52:34,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 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 949 [2024-10-10 23:52:34,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:52:34,108 INFO L225 Difference]: With dead ends: 97295 [2024-10-10 23:52:34,108 INFO L226 Difference]: Without dead ends: 51063 [2024-10-10 23:52:34,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 953 GetRequests, 948 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:52:34,133 INFO L432 NwaCegarLoop]: 1045 mSDtfsCounter, 338 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 578 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 2253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 578 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:52:34,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1050 Invalid, 2253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [578 Valid, 1675 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:52:34,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51063 states. [2024-10-10 23:52:34,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51063 to 48303. [2024-10-10 23:52:34,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48303 states, 48302 states have (on average 1.0329385946751688) internal successors, (49893), 48302 states have internal predecessors, (49893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48303 states to 48303 states and 49893 transitions. [2024-10-10 23:52:34,539 INFO L78 Accepts]: Start accepts. Automaton has 48303 states and 49893 transitions. Word has length 949 [2024-10-10 23:52:34,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:52:34,540 INFO L471 AbstractCegarLoop]: Abstraction has 48303 states and 49893 transitions. [2024-10-10 23:52:34,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:34,540 INFO L276 IsEmpty]: Start isEmpty. Operand 48303 states and 49893 transitions. [2024-10-10 23:52:34,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 996 [2024-10-10 23:52:34,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:52:34,559 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, 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, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:52:34,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-10 23:52:34,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-10 23:52:34,760 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:52:34,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:52:34,760 INFO L85 PathProgramCache]: Analyzing trace with hash -13868936, now seen corresponding path program 1 times [2024-10-10 23:52:34,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:52:34,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533001044] [2024-10-10 23:52:34,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:52:34,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:52:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:52:35,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 941 trivial. 0 not checked. [2024-10-10 23:52:35,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:52:35,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533001044] [2024-10-10 23:52:35,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533001044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:52:35,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:52:35,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:52:35,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993034664] [2024-10-10 23:52:35,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:52:35,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:52:35,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:52:35,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:52:35,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:52:35,549 INFO L87 Difference]: Start difference. First operand 48303 states and 49893 transitions. Second operand has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:38,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:52:38,489 INFO L93 Difference]: Finished difference Result 117316 states and 121499 transitions. [2024-10-10 23:52:38,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 23:52:38,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 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 995 [2024-10-10 23:52:38,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:52:38,567 INFO L225 Difference]: With dead ends: 117316 [2024-10-10 23:52:38,568 INFO L226 Difference]: Without dead ends: 68313 [2024-10-10 23:52:38,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:52:38,607 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1361 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3451 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 3849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 3451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:52:38,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 168 Invalid, 3849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 3451 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:52:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68313 states. [2024-10-10 23:52:39,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68313 to 66243. [2024-10-10 23:52:39,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66243 states, 66242 states have (on average 1.0342230005132695) internal successors, (68509), 66242 states have internal predecessors, (68509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:39,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66243 states to 66243 states and 68509 transitions. [2024-10-10 23:52:39,361 INFO L78 Accepts]: Start accepts. Automaton has 66243 states and 68509 transitions. Word has length 995 [2024-10-10 23:52:39,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:52:39,362 INFO L471 AbstractCegarLoop]: Abstraction has 66243 states and 68509 transitions. [2024-10-10 23:52:39,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:39,362 INFO L276 IsEmpty]: Start isEmpty. Operand 66243 states and 68509 transitions. [2024-10-10 23:52:39,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1318 [2024-10-10 23:52:39,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:52:39,416 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, 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, 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:52:39,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:52:39,416 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:52:39,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:52:39,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1752107132, now seen corresponding path program 1 times [2024-10-10 23:52:39,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:52:39,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090368903] [2024-10-10 23:52:39,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:52:39,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:52:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:52:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 1330 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-10-10 23:52:40,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:52:40,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090368903] [2024-10-10 23:52:40,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090368903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:52:40,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:52:40,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:52:40,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221477660] [2024-10-10 23:52:40,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:52:40,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:52:40,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:52:40,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:52:40,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:52:40,103 INFO L87 Difference]: Start difference. First operand 66243 states and 68509 transitions. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:42,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:52:42,119 INFO L93 Difference]: Finished difference Result 131103 states and 135599 transitions. [2024-10-10 23:52:42,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:52:42,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 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 1317 [2024-10-10 23:52:42,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:52:42,120 INFO L225 Difference]: With dead ends: 131103 [2024-10-10 23:52:42,120 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:52:42,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:52:42,158 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 455 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:52:42,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 249 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1794 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:52:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:52:42,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:52:42,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:42,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:52:42,159 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1317 [2024-10-10 23:52:42,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:52:42,159 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:52:42,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:52:42,160 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:52:42,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:52:42,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:52:42,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:52:42,165 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:52:42,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:52:44,141 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:52:44,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:52:44 BoogieIcfgContainer [2024-10-10 23:52:44,157 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:52:44,158 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:52:44,158 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:52:44,158 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:52:44,158 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:51:43" (3/4) ... [2024-10-10 23:52:44,159 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:52:44,207 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-10 23:52:44,213 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:52:44,218 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:52:44,224 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:52:44,538 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:52:44,539 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:52:44,539 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:52:44,540 INFO L158 Benchmark]: Toolchain (without parser) took 66117.47ms. Allocated memory was 184.5MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 117.2MB in the beginning and 5.0GB in the end (delta: -4.8GB). Peak memory consumption was 692.3MB. Max. memory is 16.1GB. [2024-10-10 23:52:44,540 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 184.5MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:52:44,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1356.72ms. Allocated memory was 184.5MB in the beginning and 253.8MB in the end (delta: 69.2MB). Free memory was 117.2MB in the beginning and 147.2MB in the end (delta: -30.0MB). Peak memory consumption was 73.2MB. Max. memory is 16.1GB. [2024-10-10 23:52:44,540 INFO L158 Benchmark]: Boogie Procedure Inliner took 318.75ms. Allocated memory is still 253.8MB. Free memory was 147.2MB in the beginning and 180.7MB in the end (delta: -33.5MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. [2024-10-10 23:52:44,541 INFO L158 Benchmark]: Boogie Preprocessor took 359.79ms. Allocated memory is still 253.8MB. Free memory was 180.7MB in the beginning and 167.8MB in the end (delta: 12.9MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. [2024-10-10 23:52:44,541 INFO L158 Benchmark]: RCFGBuilder took 3365.28ms. Allocated memory was 253.8MB in the beginning and 471.9MB in the end (delta: 218.1MB). Free memory was 167.8MB in the beginning and 188.2MB in the end (delta: -20.4MB). Peak memory consumption was 199.4MB. Max. memory is 16.1GB. [2024-10-10 23:52:44,541 INFO L158 Benchmark]: TraceAbstraction took 60323.37ms. Allocated memory was 471.9MB in the beginning and 5.7GB in the end (delta: 5.2GB). Free memory was 187.1MB in the beginning and 5.0GB in the end (delta: -4.8GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-10-10 23:52:44,541 INFO L158 Benchmark]: Witness Printer took 381.29ms. Allocated memory is still 5.7GB. Free memory was 5.0GB in the beginning and 5.0GB in the end (delta: 55.6MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-10-10 23:52:44,543 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.17ms. Allocated memory is still 184.5MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1356.72ms. Allocated memory was 184.5MB in the beginning and 253.8MB in the end (delta: 69.2MB). Free memory was 117.2MB in the beginning and 147.2MB in the end (delta: -30.0MB). Peak memory consumption was 73.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 318.75ms. Allocated memory is still 253.8MB. Free memory was 147.2MB in the beginning and 180.7MB in the end (delta: -33.5MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 359.79ms. Allocated memory is still 253.8MB. Free memory was 180.7MB in the beginning and 167.8MB in the end (delta: 12.9MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. * RCFGBuilder took 3365.28ms. Allocated memory was 253.8MB in the beginning and 471.9MB in the end (delta: 218.1MB). Free memory was 167.8MB in the beginning and 188.2MB in the end (delta: -20.4MB). Peak memory consumption was 199.4MB. Max. memory is 16.1GB. * TraceAbstraction took 60323.37ms. Allocated memory was 471.9MB in the beginning and 5.7GB in the end (delta: 5.2GB). Free memory was 187.1MB in the beginning and 5.0GB in the end (delta: -4.8GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 381.29ms. Allocated memory is still 5.7GB. Free memory was 5.0GB in the beginning and 5.0GB in the end (delta: 55.6MB). Peak memory consumption was 52.4MB. 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: 157]: 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, 695 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.3s, OverallIterations: 17, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 37.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10760 SdHoareTripleChecker+Valid, 33.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10760 mSDsluCounter, 12199 SdHoareTripleChecker+Invalid, 27.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 6268 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35425 IncrementalHoareTripleChecker+Invalid, 41693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6268 mSolverCounterUnsat, 12079 mSDtfsCounter, 35425 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3793 GetRequests, 3758 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66243occurred in iteration=16, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 8280 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 12994 NumberOfCodeBlocks, 12994 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 12972 ConstructedInterpolants, 0 QuantifiedInterpolants, 28312 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4415 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 22 InterpolantComputations, 17 PerfectInterpolantSequences, 11077/11366 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: 4269]: Loop Invariant Derived loop invariant: ((((((((((((6 <= a15) || (a24 == 3)) || ((a24 <= 0) && (a3 <= 417))) || (a24 == 1)) || ((a15 != 4) && (a18 == 10))) || ((a15 != 4) && (a3 <= 417))) || ((a24 <= 0) && (a15 != 4))) || ((3 <= a24) && (a3 <= 417))) || (11 <= a18)) || (a18 == 9)) || ((a18 <= 8) && (a15 <= 4))) || (a3 <= 99)) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:52:44,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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