./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/Problem15_label56.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/Problem15_label56.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 a498fb7710a33a2d85f447c670841227251b50491988d49c611ac72650abaae2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:39:23,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:39:23,487 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:39:23,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:39:23,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:39:23,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:39:23,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:39:23,530 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:39:23,531 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:39:23,531 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:39:23,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:39:23,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:39:23,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:39:23,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:39:23,535 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:39:23,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:39:23,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:39:23,535 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:39:23,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:39:23,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:39:23,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:39:23,539 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:39:23,539 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:39:23,539 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:39:23,540 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:39:23,540 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:39:23,540 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:39:23,540 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:39:23,540 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:39:23,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:39:23,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:39:23,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:39:23,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:39:23,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:39:23,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:39:23,541 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:39:23,541 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:39:23,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:39:23,542 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:39:23,542 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:39:23,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:39:23,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:39:23,543 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 -> a498fb7710a33a2d85f447c670841227251b50491988d49c611ac72650abaae2 [2024-10-10 23:39:23,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:39:23,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:39:23,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:39:23,812 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:39:23,812 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:39:23,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label56.c [2024-10-10 23:39:25,115 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:39:25,394 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:39:25,394 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label56.c [2024-10-10 23:39:25,410 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0cb428923/800827b54b2240639fc2723d0c29978c/FLAG39963c539 [2024-10-10 23:39:25,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0cb428923/800827b54b2240639fc2723d0c29978c [2024-10-10 23:39:25,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:39:25,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:39:25,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:39:25,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:39:25,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:39:25,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:39:25" (1/1) ... [2024-10-10 23:39:25,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e48ec73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:25, skipping insertion in model container [2024-10-10 23:39:25,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:39:25" (1/1) ... [2024-10-10 23:39:25,499 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:39:25,711 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/Problem15_label56.c[4182,4195] [2024-10-10 23:39:26,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:39:26,107 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:39:26,120 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/Problem15_label56.c[4182,4195] [2024-10-10 23:39:26,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:39:26,277 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:39:26,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:26 WrapperNode [2024-10-10 23:39:26,278 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:39:26,279 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:39:26,279 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:39:26,279 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:39:26,285 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:39:26" (1/1) ... [2024-10-10 23:39:26,322 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:39:26" (1/1) ... [2024-10-10 23:39:26,467 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-10-10 23:39:26,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:39:26,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:39:26,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:39:26,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:39:26,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:26" (1/1) ... [2024-10-10 23:39:26,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:26" (1/1) ... [2024-10-10 23:39:26,494 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:26" (1/1) ... [2024-10-10 23:39:26,534 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:39:26,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:26" (1/1) ... [2024-10-10 23:39:26,534 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:26" (1/1) ... [2024-10-10 23:39:26,576 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:26" (1/1) ... [2024-10-10 23:39:26,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:26" (1/1) ... [2024-10-10 23:39:26,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:26" (1/1) ... [2024-10-10 23:39:26,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:26" (1/1) ... [2024-10-10 23:39:26,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:39:26,634 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:39:26,634 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:39:26,634 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:39:26,635 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:26" (1/1) ... [2024-10-10 23:39:26,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:39:26,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:39:26,662 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:39:26,697 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:39:26,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:39:26,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:39:26,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:39:26,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:39:26,800 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:39:26,802 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:39:28,826 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-10-10 23:39:28,826 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:39:28,868 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:39:28,868 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:39:28,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:39:28 BoogieIcfgContainer [2024-10-10 23:39:28,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:39:28,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:39:28,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:39:28,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:39:28,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:39:25" (1/3) ... [2024-10-10 23:39:28,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd56db1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:39:28, skipping insertion in model container [2024-10-10 23:39:28,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:26" (2/3) ... [2024-10-10 23:39:28,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd56db1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:39:28, skipping insertion in model container [2024-10-10 23:39:28,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:39:28" (3/3) ... [2024-10-10 23:39:28,875 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label56.c [2024-10-10 23:39:28,888 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:39:28,889 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:39:28,939 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:39:28,944 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;@545a2889, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:39:28,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:39:28,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 0 states have call successors, (0), 0 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:39:28,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-10 23:39:28,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:28,955 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:39:28,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:28,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:28,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1925054003, now seen corresponding path program 1 times [2024-10-10 23:39:28,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:28,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339609129] [2024-10-10 23:39:28,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:28,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:29,109 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:39:29,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:29,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339609129] [2024-10-10 23:39:29,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339609129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:29,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:29,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:39:29,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998415451] [2024-10-10 23:39:29,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:29,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:39:29,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:29,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:39:29,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:39:29,142 INFO L87 Difference]: Start difference. First operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 0 states have call successors, (0), 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 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:29,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:29,187 INFO L93 Difference]: Finished difference Result 723 states and 1375 transitions. [2024-10-10 23:39:29,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:39:29,189 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-10 23:39:29,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:29,203 INFO L225 Difference]: With dead ends: 723 [2024-10-10 23:39:29,203 INFO L226 Difference]: Without dead ends: 360 [2024-10-10 23:39:29,207 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:39:29,211 INFO L432 NwaCegarLoop]: 623 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, 623 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:39:29,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 623 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:39:29,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-10 23:39:29,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-10-10 23:39:29,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.7353760445682451) internal successors, (623), 359 states have internal predecessors, (623), 0 states have call successors, (0), 0 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:39:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 623 transitions. [2024-10-10 23:39:29,262 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 623 transitions. Word has length 32 [2024-10-10 23:39:29,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:29,262 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 623 transitions. [2024-10-10 23:39:29,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:29,262 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 623 transitions. [2024-10-10 23:39:29,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-10 23:39:29,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:29,263 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:39:29,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:39:29,263 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:29,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:29,264 INFO L85 PathProgramCache]: Analyzing trace with hash -606613004, now seen corresponding path program 1 times [2024-10-10 23:39:29,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:29,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74091707] [2024-10-10 23:39:29,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:29,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:29,400 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:39:29,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:29,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74091707] [2024-10-10 23:39:29,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74091707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:29,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:29,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:39:29,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066395537] [2024-10-10 23:39:29,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:29,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:29,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:29,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:29,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:29,402 INFO L87 Difference]: Start difference. First operand 360 states and 623 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:30,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:30,852 INFO L93 Difference]: Finished difference Result 1023 states and 1787 transitions. [2024-10-10 23:39:30,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:30,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-10 23:39:30,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:30,856 INFO L225 Difference]: With dead ends: 1023 [2024-10-10 23:39:30,856 INFO L226 Difference]: Without dead ends: 664 [2024-10-10 23:39:30,857 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:39:30,858 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 284 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:30,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 316 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:39:30,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2024-10-10 23:39:30,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 662. [2024-10-10 23:39:30,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.4826021180030258) internal successors, (980), 661 states have internal predecessors, (980), 0 states have call successors, (0), 0 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:39:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 980 transitions. [2024-10-10 23:39:30,885 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 980 transitions. Word has length 32 [2024-10-10 23:39:30,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:30,885 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 980 transitions. [2024-10-10 23:39:30,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 980 transitions. [2024-10-10 23:39:30,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-10 23:39:30,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:30,889 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:30,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:39:30,890 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:30,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:30,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1740687876, now seen corresponding path program 1 times [2024-10-10 23:39:30,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:30,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726313797] [2024-10-10 23:39:30,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:30,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:31,178 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:39:31,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:31,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726313797] [2024-10-10 23:39:31,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726313797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:31,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:31,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:39:31,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455806379] [2024-10-10 23:39:31,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:31,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:31,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:31,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:31,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:31,181 INFO L87 Difference]: Start difference. First operand 662 states and 980 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 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:39:32,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:32,294 INFO L93 Difference]: Finished difference Result 1623 states and 2314 transitions. [2024-10-10 23:39:32,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:32,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2024-10-10 23:39:32,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:32,298 INFO L225 Difference]: With dead ends: 1623 [2024-10-10 23:39:32,298 INFO L226 Difference]: Without dead ends: 962 [2024-10-10 23:39:32,299 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:39:32,300 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:32,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 335 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:39:32,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-10-10 23:39:32,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2024-10-10 23:39:32,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 1.3631633714880333) internal successors, (1310), 961 states have internal predecessors, (1310), 0 states have call successors, (0), 0 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:39:32,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1310 transitions. [2024-10-10 23:39:32,323 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1310 transitions. Word has length 97 [2024-10-10 23:39:32,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:32,324 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1310 transitions. [2024-10-10 23:39:32,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 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:39:32,325 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1310 transitions. [2024-10-10 23:39:32,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-10 23:39:32,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:32,328 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:32,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:39:32,329 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:32,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:32,333 INFO L85 PathProgramCache]: Analyzing trace with hash -568450935, now seen corresponding path program 1 times [2024-10-10 23:39:32,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:32,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890511848] [2024-10-10 23:39:32,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:32,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:39:32,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:32,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890511848] [2024-10-10 23:39:32,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890511848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:32,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:32,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:39:32,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907228234] [2024-10-10 23:39:32,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:32,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:32,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:32,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:32,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:32,457 INFO L87 Difference]: Start difference. First operand 962 states and 1310 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 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:39:34,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:34,164 INFO L93 Difference]: Finished difference Result 2228 states and 3185 transitions. [2024-10-10 23:39:34,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:34,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2024-10-10 23:39:34,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:34,170 INFO L225 Difference]: With dead ends: 2228 [2024-10-10 23:39:34,170 INFO L226 Difference]: Without dead ends: 1566 [2024-10-10 23:39:34,171 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:39:34,172 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 256 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:34,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 316 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:39:34,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2024-10-10 23:39:34,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1265. [2024-10-10 23:39:34,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.3045886075949367) internal successors, (1649), 1264 states have internal predecessors, (1649), 0 states have call successors, (0), 0 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:39:34,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1649 transitions. [2024-10-10 23:39:34,191 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1649 transitions. Word has length 102 [2024-10-10 23:39:34,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:34,193 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1649 transitions. [2024-10-10 23:39:34,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 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:39:34,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1649 transitions. [2024-10-10 23:39:34,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-10 23:39:34,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:34,197 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:39:34,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:39:34,197 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:34,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:34,198 INFO L85 PathProgramCache]: Analyzing trace with hash 157141445, now seen corresponding path program 1 times [2024-10-10 23:39:34,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:34,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200344617] [2024-10-10 23:39:34,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:34,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:39:34,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:34,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200344617] [2024-10-10 23:39:34,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200344617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:34,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:34,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:39:34,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300829251] [2024-10-10 23:39:34,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:34,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:39:34,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:34,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:39:34,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:39:34,397 INFO L87 Difference]: Start difference. First operand 1265 states and 1649 transitions. Second operand has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 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:39:36,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:36,839 INFO L93 Difference]: Finished difference Result 4669 states and 6169 transitions. [2024-10-10 23:39:36,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:39:36,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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 198 [2024-10-10 23:39:36,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:36,848 INFO L225 Difference]: With dead ends: 4669 [2024-10-10 23:39:36,848 INFO L226 Difference]: Without dead ends: 3405 [2024-10-10 23:39:36,850 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:39:36,854 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 486 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 2549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:36,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 376 Invalid, 2549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:39:36,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states. [2024-10-10 23:39:36,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 3380. [2024-10-10 23:39:36,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3380 states, 3379 states have (on average 1.2367564368156259) internal successors, (4179), 3379 states have internal predecessors, (4179), 0 states have call successors, (0), 0 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:39:36,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 3380 states and 4179 transitions. [2024-10-10 23:39:36,900 INFO L78 Accepts]: Start accepts. Automaton has 3380 states and 4179 transitions. Word has length 198 [2024-10-10 23:39:36,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:36,901 INFO L471 AbstractCegarLoop]: Abstraction has 3380 states and 4179 transitions. [2024-10-10 23:39:36,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 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:39:36,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 4179 transitions. [2024-10-10 23:39:36,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-10 23:39:36,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:36,908 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:39:36,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:39:36,908 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:36,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:36,909 INFO L85 PathProgramCache]: Analyzing trace with hash 151677519, now seen corresponding path program 1 times [2024-10-10 23:39:36,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:36,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108374103] [2024-10-10 23:39:36,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:36,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-10 23:39:37,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:37,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108374103] [2024-10-10 23:39:37,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108374103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:37,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:37,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:39:37,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517799536] [2024-10-10 23:39:37,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:37,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:37,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:37,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:37,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:37,073 INFO L87 Difference]: Start difference. First operand 3380 states and 4179 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:38,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:38,231 INFO L93 Difference]: Finished difference Result 8562 states and 10753 transitions. [2024-10-10 23:39:38,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:38,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202 [2024-10-10 23:39:38,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:38,246 INFO L225 Difference]: With dead ends: 8562 [2024-10-10 23:39:38,247 INFO L226 Difference]: Without dead ends: 5482 [2024-10-10 23:39:38,252 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:39:38,253 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:38,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 337 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:39:38,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5482 states. [2024-10-10 23:39:38,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5482 to 5477. [2024-10-10 23:39:38,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5477 states, 5476 states have (on average 1.168736303871439) internal successors, (6400), 5476 states have internal predecessors, (6400), 0 states have call successors, (0), 0 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:39:38,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5477 states to 5477 states and 6400 transitions. [2024-10-10 23:39:38,332 INFO L78 Accepts]: Start accepts. Automaton has 5477 states and 6400 transitions. Word has length 202 [2024-10-10 23:39:38,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:38,333 INFO L471 AbstractCegarLoop]: Abstraction has 5477 states and 6400 transitions. [2024-10-10 23:39:38,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:38,333 INFO L276 IsEmpty]: Start isEmpty. Operand 5477 states and 6400 transitions. [2024-10-10 23:39:38,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2024-10-10 23:39:38,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:38,337 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:39:38,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:39:38,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:38,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:38,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1391374055, now seen corresponding path program 1 times [2024-10-10 23:39:38,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:38,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953081281] [2024-10-10 23:39:38,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:38,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:38,978 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-10 23:39:38,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:38,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953081281] [2024-10-10 23:39:38,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953081281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:38,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:38,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:39:38,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115633462] [2024-10-10 23:39:38,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:38,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:38,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:38,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:39,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:39,009 INFO L87 Difference]: Start difference. First operand 5477 states and 6400 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 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:39:40,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:40,076 INFO L93 Difference]: Finished difference Result 10654 states and 12488 transitions. [2024-10-10 23:39:40,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:40,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 304 [2024-10-10 23:39:40,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:40,089 INFO L225 Difference]: With dead ends: 10654 [2024-10-10 23:39:40,089 INFO L226 Difference]: Without dead ends: 5477 [2024-10-10 23:39:40,095 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:39:40,098 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:40,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 357 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:39:40,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5477 states. [2024-10-10 23:39:40,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5477 to 5477. [2024-10-10 23:39:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5477 states, 5476 states have (on average 1.1676406135865596) internal successors, (6394), 5476 states have internal predecessors, (6394), 0 states have call successors, (0), 0 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:39:40,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5477 states to 5477 states and 6394 transitions. [2024-10-10 23:39:40,172 INFO L78 Accepts]: Start accepts. Automaton has 5477 states and 6394 transitions. Word has length 304 [2024-10-10 23:39:40,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:40,172 INFO L471 AbstractCegarLoop]: Abstraction has 5477 states and 6394 transitions. [2024-10-10 23:39:40,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 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:39:40,173 INFO L276 IsEmpty]: Start isEmpty. Operand 5477 states and 6394 transitions. [2024-10-10 23:39:40,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2024-10-10 23:39:40,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:40,177 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:39:40,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:39:40,177 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:40,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:40,178 INFO L85 PathProgramCache]: Analyzing trace with hash 634668354, now seen corresponding path program 1 times [2024-10-10 23:39:40,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:40,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368811595] [2024-10-10 23:39:40,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:40,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:40,334 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-10 23:39:40,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:40,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368811595] [2024-10-10 23:39:40,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368811595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:40,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:40,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:39:40,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047007959] [2024-10-10 23:39:40,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:40,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:40,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:40,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:40,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:40,336 INFO L87 Difference]: Start difference. First operand 5477 states and 6394 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:41,754 INFO L93 Difference]: Finished difference Result 11850 states and 14150 transitions. [2024-10-10 23:39:41,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:41,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 319 [2024-10-10 23:39:41,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:41,769 INFO L225 Difference]: With dead ends: 11850 [2024-10-10 23:39:41,769 INFO L226 Difference]: Without dead ends: 6673 [2024-10-10 23:39:41,774 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:39:41,774 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 281 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:41,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 320 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:39:41,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6673 states. [2024-10-10 23:39:41,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6673 to 4875. [2024-10-10 23:39:41,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4875 states, 4874 states have (on average 1.1805498563807961) internal successors, (5754), 4874 states have internal predecessors, (5754), 0 states have call successors, (0), 0 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:39:41,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 5754 transitions. [2024-10-10 23:39:41,842 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 5754 transitions. Word has length 319 [2024-10-10 23:39:41,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:41,843 INFO L471 AbstractCegarLoop]: Abstraction has 4875 states and 5754 transitions. [2024-10-10 23:39:41,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:41,843 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 5754 transitions. [2024-10-10 23:39:41,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2024-10-10 23:39:41,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:41,848 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:39:41,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:39:41,848 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:41,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:41,849 INFO L85 PathProgramCache]: Analyzing trace with hash -423690411, now seen corresponding path program 1 times [2024-10-10 23:39:41,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:41,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403251128] [2024-10-10 23:39:41,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:41,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:42,093 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-10 23:39:42,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:42,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403251128] [2024-10-10 23:39:42,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403251128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:42,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:42,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:39:42,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340776893] [2024-10-10 23:39:42,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:42,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:42,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:42,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:42,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:42,097 INFO L87 Difference]: Start difference. First operand 4875 states and 5754 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:43,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:43,272 INFO L93 Difference]: Finished difference Result 11851 states and 14243 transitions. [2024-10-10 23:39:43,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:43,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 378 [2024-10-10 23:39:43,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:43,294 INFO L225 Difference]: With dead ends: 11851 [2024-10-10 23:39:43,296 INFO L226 Difference]: Without dead ends: 7276 [2024-10-10 23:39:43,301 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:39:43,303 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 295 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:43,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 634 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:39:43,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7276 states. [2024-10-10 23:39:43,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7276 to 6379. [2024-10-10 23:39:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6379 states, 6378 states have (on average 1.1558482282847287) internal successors, (7372), 6378 states have internal predecessors, (7372), 0 states have call successors, (0), 0 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:39:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6379 states to 6379 states and 7372 transitions. [2024-10-10 23:39:43,425 INFO L78 Accepts]: Start accepts. Automaton has 6379 states and 7372 transitions. Word has length 378 [2024-10-10 23:39:43,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:43,426 INFO L471 AbstractCegarLoop]: Abstraction has 6379 states and 7372 transitions. [2024-10-10 23:39:43,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:43,431 INFO L276 IsEmpty]: Start isEmpty. Operand 6379 states and 7372 transitions. [2024-10-10 23:39:43,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2024-10-10 23:39:43,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:43,437 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:39:43,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:39:43,437 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:43,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:43,441 INFO L85 PathProgramCache]: Analyzing trace with hash 528521281, now seen corresponding path program 1 times [2024-10-10 23:39:43,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:43,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310084295] [2024-10-10 23:39:43,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:43,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:43,702 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:39:43,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:43,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310084295] [2024-10-10 23:39:43,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310084295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:43,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:43,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:39:43,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439891777] [2024-10-10 23:39:43,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:43,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:43,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:43,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:43,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:43,706 INFO L87 Difference]: Start difference. First operand 6379 states and 7372 transitions. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:44,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:44,814 INFO L93 Difference]: Finished difference Result 14562 states and 17151 transitions. [2024-10-10 23:39:44,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:44,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 384 [2024-10-10 23:39:44,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:44,824 INFO L225 Difference]: With dead ends: 14562 [2024-10-10 23:39:44,825 INFO L226 Difference]: Without dead ends: 8483 [2024-10-10 23:39:44,828 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:39:44,828 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 248 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:44,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 600 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:39:44,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8483 states. [2024-10-10 23:39:44,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8483 to 7583. [2024-10-10 23:39:44,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7583 states, 7582 states have (on average 1.1425745185966762) internal successors, (8663), 7582 states have internal predecessors, (8663), 0 states have call successors, (0), 0 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:39:44,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7583 states to 7583 states and 8663 transitions. [2024-10-10 23:39:44,894 INFO L78 Accepts]: Start accepts. Automaton has 7583 states and 8663 transitions. Word has length 384 [2024-10-10 23:39:44,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:44,894 INFO L471 AbstractCegarLoop]: Abstraction has 7583 states and 8663 transitions. [2024-10-10 23:39:44,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:44,895 INFO L276 IsEmpty]: Start isEmpty. Operand 7583 states and 8663 transitions. [2024-10-10 23:39:44,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2024-10-10 23:39:44,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:44,899 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:39:44,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:39:44,900 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:44,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:44,900 INFO L85 PathProgramCache]: Analyzing trace with hash 279650674, now seen corresponding path program 1 times [2024-10-10 23:39:44,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:44,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903828231] [2024-10-10 23:39:44,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:44,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:45,108 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-10 23:39:45,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:45,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903828231] [2024-10-10 23:39:45,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903828231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:45,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:45,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:39:45,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41295192] [2024-10-10 23:39:45,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:45,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:45,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:45,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:45,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:45,110 INFO L87 Difference]: Start difference. First operand 7583 states and 8663 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:46,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:46,092 INFO L93 Difference]: Finished difference Result 16660 states and 19397 transitions. [2024-10-10 23:39:46,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:46,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 401 [2024-10-10 23:39:46,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:46,104 INFO L225 Difference]: With dead ends: 16660 [2024-10-10 23:39:46,104 INFO L226 Difference]: Without dead ends: 9377 [2024-10-10 23:39:46,110 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:39:46,111 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 246 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:46,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 616 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:39:46,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9377 states. [2024-10-10 23:39:46,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9377 to 9074. [2024-10-10 23:39:46,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9074 states, 9073 states have (on average 1.132040119034498) internal successors, (10271), 9073 states have internal predecessors, (10271), 0 states have call successors, (0), 0 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:39:46,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9074 states to 9074 states and 10271 transitions. [2024-10-10 23:39:46,192 INFO L78 Accepts]: Start accepts. Automaton has 9074 states and 10271 transitions. Word has length 401 [2024-10-10 23:39:46,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:46,194 INFO L471 AbstractCegarLoop]: Abstraction has 9074 states and 10271 transitions. [2024-10-10 23:39:46,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:46,194 INFO L276 IsEmpty]: Start isEmpty. Operand 9074 states and 10271 transitions. [2024-10-10 23:39:46,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2024-10-10 23:39:46,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:46,200 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:39:46,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:39:46,200 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:46,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:46,201 INFO L85 PathProgramCache]: Analyzing trace with hash -363828627, now seen corresponding path program 1 times [2024-10-10 23:39:46,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:46,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424381484] [2024-10-10 23:39:46,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:46,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 471 proven. 39 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-10-10 23:39:46,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:46,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424381484] [2024-10-10 23:39:46,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424381484] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:39:46,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46946263] [2024-10-10 23:39:46,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:46,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:39:46,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:39:46,699 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:39:46,700 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:39:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:46,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:39:46,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:39:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-10-10 23:39:46,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:39:46,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46946263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:46,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:39:46,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:39:46,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953528152] [2024-10-10 23:39:46,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:46,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:46,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:46,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:46,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:39:46,938 INFO L87 Difference]: Start difference. First operand 9074 states and 10271 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:48,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:48,298 INFO L93 Difference]: Finished difference Result 20239 states and 23192 transitions. [2024-10-10 23:39:48,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:48,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 516 [2024-10-10 23:39:48,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:48,313 INFO L225 Difference]: With dead ends: 20239 [2024-10-10 23:39:48,313 INFO L226 Difference]: Without dead ends: 11465 [2024-10-10 23:39:48,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:39:48,322 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 384 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:48,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 444 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:39:48,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11465 states. [2024-10-10 23:39:48,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11465 to 11465. [2024-10-10 23:39:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11465 states, 11464 states have (on average 1.13668876482903) internal successors, (13031), 11464 states have internal predecessors, (13031), 0 states have call successors, (0), 0 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:39:48,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11465 states to 11465 states and 13031 transitions. [2024-10-10 23:39:48,461 INFO L78 Accepts]: Start accepts. Automaton has 11465 states and 13031 transitions. Word has length 516 [2024-10-10 23:39:48,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:48,462 INFO L471 AbstractCegarLoop]: Abstraction has 11465 states and 13031 transitions. [2024-10-10 23:39:48,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:48,462 INFO L276 IsEmpty]: Start isEmpty. Operand 11465 states and 13031 transitions. [2024-10-10 23:39:48,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2024-10-10 23:39:48,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:48,466 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:39:48,482 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:39:48,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-10 23:39:48,672 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:48,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:48,672 INFO L85 PathProgramCache]: Analyzing trace with hash -118720777, now seen corresponding path program 1 times [2024-10-10 23:39:48,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:48,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859087619] [2024-10-10 23:39:48,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:48,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:49,043 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-10-10 23:39:49,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:49,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859087619] [2024-10-10 23:39:49,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859087619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:49,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:49,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:39:49,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090925533] [2024-10-10 23:39:49,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:49,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:49,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:49,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:49,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:49,046 INFO L87 Difference]: Start difference. First operand 11465 states and 13031 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:50,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:50,247 INFO L93 Difference]: Finished difference Result 27129 states and 31139 transitions. [2024-10-10 23:39:50,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:50,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 520 [2024-10-10 23:39:50,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:50,269 INFO L225 Difference]: With dead ends: 27129 [2024-10-10 23:39:50,269 INFO L226 Difference]: Without dead ends: 15964 [2024-10-10 23:39:50,281 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:39:50,281 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 246 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:50,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 618 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:39:50,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15964 states. [2024-10-10 23:39:50,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15964 to 15355. [2024-10-10 23:39:50,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15355 states, 15354 states have (on average 1.1286309756415267) internal successors, (17329), 15354 states have internal predecessors, (17329), 0 states have call successors, (0), 0 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:39:50,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15355 states to 15355 states and 17329 transitions. [2024-10-10 23:39:50,437 INFO L78 Accepts]: Start accepts. Automaton has 15355 states and 17329 transitions. Word has length 520 [2024-10-10 23:39:50,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:50,438 INFO L471 AbstractCegarLoop]: Abstraction has 15355 states and 17329 transitions. [2024-10-10 23:39:50,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:50,438 INFO L276 IsEmpty]: Start isEmpty. Operand 15355 states and 17329 transitions. [2024-10-10 23:39:50,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2024-10-10 23:39:50,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:50,446 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:39:50,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:39:50,446 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:50,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:50,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1082950923, now seen corresponding path program 1 times [2024-10-10 23:39:50,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:50,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350505910] [2024-10-10 23:39:50,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:50,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 628 proven. 39 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2024-10-10 23:39:50,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:50,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350505910] [2024-10-10 23:39:50,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350505910] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:39:50,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788783769] [2024-10-10 23:39:50,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:50,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:39:50,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:39:50,944 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:39:50,946 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:39:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:51,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:39:51,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:39:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-10-10 23:39:51,254 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:39:51,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788783769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:51,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:39:51,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:39:51,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096084182] [2024-10-10 23:39:51,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:51,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:51,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:51,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:51,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:39:51,256 INFO L87 Difference]: Start difference. First operand 15355 states and 17329 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 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:39:52,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:52,331 INFO L93 Difference]: Finished difference Result 30107 states and 34017 transitions. [2024-10-10 23:39:52,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:52,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 595 [2024-10-10 23:39:52,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:52,352 INFO L225 Difference]: With dead ends: 30107 [2024-10-10 23:39:52,352 INFO L226 Difference]: Without dead ends: 15052 [2024-10-10 23:39:52,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:39:52,367 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 252 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:52,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 601 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:39:52,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15052 states. [2024-10-10 23:39:52,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15052 to 15051. [2024-10-10 23:39:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15051 states, 15050 states have (on average 1.0795348837209302) internal successors, (16247), 15050 states have internal predecessors, (16247), 0 states have call successors, (0), 0 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:39:52,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15051 states to 15051 states and 16247 transitions. [2024-10-10 23:39:52,507 INFO L78 Accepts]: Start accepts. Automaton has 15051 states and 16247 transitions. Word has length 595 [2024-10-10 23:39:52,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:52,508 INFO L471 AbstractCegarLoop]: Abstraction has 15051 states and 16247 transitions. [2024-10-10 23:39:52,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 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:39:52,508 INFO L276 IsEmpty]: Start isEmpty. Operand 15051 states and 16247 transitions. [2024-10-10 23:39:52,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2024-10-10 23:39:52,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:52,515 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:39:52,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 23:39:52,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:39:52,716 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:52,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:52,717 INFO L85 PathProgramCache]: Analyzing trace with hash -355563348, now seen corresponding path program 1 times [2024-10-10 23:39:52,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:52,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894273347] [2024-10-10 23:39:52,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:52,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:53,269 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 555 proven. 39 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-10-10 23:39:53,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:53,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894273347] [2024-10-10 23:39:53,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894273347] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:39:53,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325120976] [2024-10-10 23:39:53,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:53,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:39:53,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:39:53,272 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:39:53,273 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:39:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:53,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 23:39:53,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:39:54,182 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-10-10 23:39:54,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:39:54,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325120976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:54,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:39:54,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:39:54,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95635604] [2024-10-10 23:39:54,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:54,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:39:54,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:54,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:39:54,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:39:54,186 INFO L87 Difference]: Start difference. First operand 15051 states and 16247 transitions. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 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:39:55,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:55,679 INFO L93 Difference]: Finished difference Result 31597 states and 34116 transitions. [2024-10-10 23:39:55,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:39:55,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 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 596 [2024-10-10 23:39:55,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:55,702 INFO L225 Difference]: With dead ends: 31597 [2024-10-10 23:39:55,702 INFO L226 Difference]: Without dead ends: 16248 [2024-10-10 23:39:55,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:39:55,714 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 317 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:55,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 355 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:39:55,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16248 states. [2024-10-10 23:39:55,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16248 to 15648. [2024-10-10 23:39:55,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15648 states, 15647 states have (on average 1.0770115677126606) internal successors, (16852), 15647 states have internal predecessors, (16852), 0 states have call successors, (0), 0 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:39:55,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15648 states to 15648 states and 16852 transitions. [2024-10-10 23:39:55,862 INFO L78 Accepts]: Start accepts. Automaton has 15648 states and 16852 transitions. Word has length 596 [2024-10-10 23:39:55,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:55,862 INFO L471 AbstractCegarLoop]: Abstraction has 15648 states and 16852 transitions. [2024-10-10 23:39:55,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 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:39:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 15648 states and 16852 transitions. [2024-10-10 23:39:55,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2024-10-10 23:39:55,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:55,870 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:55,885 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:39:56,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:39:56,071 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:56,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:56,072 INFO L85 PathProgramCache]: Analyzing trace with hash -809410815, now seen corresponding path program 1 times [2024-10-10 23:39:56,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:56,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993823952] [2024-10-10 23:39:56,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:56,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:56,361 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-10-10 23:39:56,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:56,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993823952] [2024-10-10 23:39:56,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993823952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:56,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:56,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:39:56,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057977215] [2024-10-10 23:39:56,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:56,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:39:56,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:56,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:39:56,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:39:56,363 INFO L87 Difference]: Start difference. First operand 15648 states and 16852 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:57,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:39:57,459 INFO L93 Difference]: Finished difference Result 39961 states and 43018 transitions. [2024-10-10 23:39:57,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:39:57,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 633 [2024-10-10 23:39:57,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:39:57,483 INFO L225 Difference]: With dead ends: 39961 [2024-10-10 23:39:57,483 INFO L226 Difference]: Without dead ends: 19530 [2024-10-10 23:39:57,496 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:39:57,497 INFO L432 NwaCegarLoop]: 605 mSDtfsCounter, 283 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:39:57,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 643 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:39:57,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19530 states. [2024-10-10 23:39:57,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19530 to 17437. [2024-10-10 23:39:57,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17437 states, 17436 states have (on average 1.0509864647855012) internal successors, (18325), 17436 states have internal predecessors, (18325), 0 states have call successors, (0), 0 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:39:57,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17437 states to 17437 states and 18325 transitions. [2024-10-10 23:39:57,720 INFO L78 Accepts]: Start accepts. Automaton has 17437 states and 18325 transitions. Word has length 633 [2024-10-10 23:39:57,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:39:57,720 INFO L471 AbstractCegarLoop]: Abstraction has 17437 states and 18325 transitions. [2024-10-10 23:39:57,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:39:57,720 INFO L276 IsEmpty]: Start isEmpty. Operand 17437 states and 18325 transitions. [2024-10-10 23:39:57,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2024-10-10 23:39:57,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:39:57,730 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:57,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:39:57,730 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:39:57,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:39:57,731 INFO L85 PathProgramCache]: Analyzing trace with hash 762759073, now seen corresponding path program 1 times [2024-10-10 23:39:57,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:39:57,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130075855] [2024-10-10 23:39:57,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:39:57,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:39:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:39:58,044 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2024-10-10 23:39:58,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:39:58,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130075855] [2024-10-10 23:39:58,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130075855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:39:58,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:39:58,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:39:58,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795704488] [2024-10-10 23:39:58,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:39:58,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:39:58,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:39:58,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:39:58,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:39:58,046 INFO L87 Difference]: Start difference. First operand 17437 states and 18325 transitions. Second operand has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 0 states have call successors, (0), 0 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:40:00,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:00,082 INFO L93 Difference]: Finished difference Result 45338 states and 47681 transitions. [2024-10-10 23:40:00,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:40:00,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 0 states have call successors, (0), 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 657 [2024-10-10 23:40:00,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:00,106 INFO L225 Difference]: With dead ends: 45338 [2024-10-10 23:40:00,106 INFO L226 Difference]: Without dead ends: 21623 [2024-10-10 23:40:00,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:40:00,122 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 716 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 1990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:00,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 449 Invalid, 1990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:40:00,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21623 states. [2024-10-10 23:40:00,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21623 to 18633. [2024-10-10 23:40:00,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18633 states, 18632 states have (on average 1.0338127951910692) internal successors, (19262), 18632 states have internal predecessors, (19262), 0 states have call successors, (0), 0 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:40:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18633 states to 18633 states and 19262 transitions. [2024-10-10 23:40:00,339 INFO L78 Accepts]: Start accepts. Automaton has 18633 states and 19262 transitions. Word has length 657 [2024-10-10 23:40:00,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:00,340 INFO L471 AbstractCegarLoop]: Abstraction has 18633 states and 19262 transitions. [2024-10-10 23:40:00,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 0 states have call successors, (0), 0 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:40:00,340 INFO L276 IsEmpty]: Start isEmpty. Operand 18633 states and 19262 transitions. [2024-10-10 23:40:00,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2024-10-10 23:40:00,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:00,347 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:40:00,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:40:00,347 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:00,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:00,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1934505671, now seen corresponding path program 1 times [2024-10-10 23:40:00,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:00,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681136711] [2024-10-10 23:40:00,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:00,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 475 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2024-10-10 23:40:00,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:00,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681136711] [2024-10-10 23:40:00,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681136711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:00,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:00,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:00,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977439908] [2024-10-10 23:40:00,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:00,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:00,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:00,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:00,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:00,605 INFO L87 Difference]: Start difference. First operand 18633 states and 19262 transitions. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 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:40:01,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:01,386 INFO L93 Difference]: Finished difference Result 37561 states and 38830 transitions. [2024-10-10 23:40:01,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:01,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 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 688 [2024-10-10 23:40:01,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:01,407 INFO L225 Difference]: With dead ends: 37561 [2024-10-10 23:40:01,407 INFO L226 Difference]: Without dead ends: 18929 [2024-10-10 23:40:01,418 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:40:01,418 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 460 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:01,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 65 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:40:01,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18929 states. [2024-10-10 23:40:01,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18929 to 18629. [2024-10-10 23:40:01,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18629 states, 18628 states have (on average 1.033659007945029) internal successors, (19255), 18628 states have internal predecessors, (19255), 0 states have call successors, (0), 0 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:40:01,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18629 states to 18629 states and 19255 transitions. [2024-10-10 23:40:01,574 INFO L78 Accepts]: Start accepts. Automaton has 18629 states and 19255 transitions. Word has length 688 [2024-10-10 23:40:01,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:01,575 INFO L471 AbstractCegarLoop]: Abstraction has 18629 states and 19255 transitions. [2024-10-10 23:40:01,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 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:40:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand 18629 states and 19255 transitions. [2024-10-10 23:40:01,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2024-10-10 23:40:01,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:01,585 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:01,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:40:01,585 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:01,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:01,586 INFO L85 PathProgramCache]: Analyzing trace with hash -238561512, now seen corresponding path program 1 times [2024-10-10 23:40:01,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:01,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945961709] [2024-10-10 23:40:01,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:01,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:01,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 608 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2024-10-10 23:40:01,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:01,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945961709] [2024-10-10 23:40:01,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945961709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:01,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:01,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:01,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947463775] [2024-10-10 23:40:01,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:01,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:01,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:01,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:01,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:01,948 INFO L87 Difference]: Start difference. First operand 18629 states and 19255 transitions. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 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:40:02,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:02,788 INFO L93 Difference]: Finished difference Result 39945 states and 41308 transitions. [2024-10-10 23:40:02,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:02,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 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 759 [2024-10-10 23:40:02,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:02,808 INFO L225 Difference]: With dead ends: 39945 [2024-10-10 23:40:02,809 INFO L226 Difference]: Without dead ends: 21317 [2024-10-10 23:40:02,819 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:40:02,819 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 183 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:02,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 165 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:40:02,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21317 states. [2024-10-10 23:40:02,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21317 to 19822. [2024-10-10 23:40:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19822 states, 19821 states have (on average 1.03112860097876) internal successors, (20438), 19821 states have internal predecessors, (20438), 0 states have call successors, (0), 0 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:40:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19822 states to 19822 states and 20438 transitions. [2024-10-10 23:40:02,987 INFO L78 Accepts]: Start accepts. Automaton has 19822 states and 20438 transitions. Word has length 759 [2024-10-10 23:40:02,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:02,987 INFO L471 AbstractCegarLoop]: Abstraction has 19822 states and 20438 transitions. [2024-10-10 23:40:02,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 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:40:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 19822 states and 20438 transitions. [2024-10-10 23:40:02,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2024-10-10 23:40:02,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:02,998 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:02,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:40:02,998 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:02,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:02,999 INFO L85 PathProgramCache]: Analyzing trace with hash -261476511, now seen corresponding path program 1 times [2024-10-10 23:40:02,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:02,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912729328] [2024-10-10 23:40:02,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:02,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:03,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2024-10-10 23:40:03,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:03,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912729328] [2024-10-10 23:40:03,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912729328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:03,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:03,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:03,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106901935] [2024-10-10 23:40:03,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:03,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:03,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:03,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:03,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:03,259 INFO L87 Difference]: Start difference. First operand 19822 states and 20438 transitions. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 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:40:04,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:04,062 INFO L93 Difference]: Finished difference Result 42032 states and 43365 transitions. [2024-10-10 23:40:04,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:04,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 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 780 [2024-10-10 23:40:04,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:04,083 INFO L225 Difference]: With dead ends: 42032 [2024-10-10 23:40:04,083 INFO L226 Difference]: Without dead ends: 21912 [2024-10-10 23:40:04,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:04,089 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 163 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:04,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 483 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:40:04,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21912 states. [2024-10-10 23:40:04,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21912 to 18021. [2024-10-10 23:40:04,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18021 states, 18020 states have (on average 1.0299112097669256) internal successors, (18559), 18020 states have internal predecessors, (18559), 0 states have call successors, (0), 0 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:40:04,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18021 states to 18021 states and 18559 transitions. [2024-10-10 23:40:04,255 INFO L78 Accepts]: Start accepts. Automaton has 18021 states and 18559 transitions. Word has length 780 [2024-10-10 23:40:04,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:04,256 INFO L471 AbstractCegarLoop]: Abstraction has 18021 states and 18559 transitions. [2024-10-10 23:40:04,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 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:40:04,256 INFO L276 IsEmpty]: Start isEmpty. Operand 18021 states and 18559 transitions. [2024-10-10 23:40:04,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2024-10-10 23:40:04,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:04,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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 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:40:04,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:40:04,267 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:04,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:04,268 INFO L85 PathProgramCache]: Analyzing trace with hash -543695735, now seen corresponding path program 1 times [2024-10-10 23:40:04,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:04,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67132092] [2024-10-10 23:40:04,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:04,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2024-10-10 23:40:04,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:04,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67132092] [2024-10-10 23:40:04,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67132092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:04,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:40:04,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:40:04,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071028266] [2024-10-10 23:40:04,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:04,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:04,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:04,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:04,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:40:04,615 INFO L87 Difference]: Start difference. First operand 18021 states and 18559 transitions. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 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:40:05,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:05,413 INFO L93 Difference]: Finished difference Result 37834 states and 38974 transitions. [2024-10-10 23:40:05,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:05,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 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 817 [2024-10-10 23:40:05,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:05,433 INFO L225 Difference]: With dead ends: 37834 [2024-10-10 23:40:05,433 INFO L226 Difference]: Without dead ends: 19814 [2024-10-10 23:40:05,444 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:40:05,445 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 310 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:05,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 527 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:40:05,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19814 states. [2024-10-10 23:40:05,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19814 to 18618. [2024-10-10 23:40:05,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18618 states, 18617 states have (on average 1.0289520330880377) internal successors, (19156), 18617 states have internal predecessors, (19156), 0 states have call successors, (0), 0 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:40:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18618 states to 18618 states and 19156 transitions. [2024-10-10 23:40:05,660 INFO L78 Accepts]: Start accepts. Automaton has 18618 states and 19156 transitions. Word has length 817 [2024-10-10 23:40:05,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:05,661 INFO L471 AbstractCegarLoop]: Abstraction has 18618 states and 19156 transitions. [2024-10-10 23:40:05,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 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:40:05,661 INFO L276 IsEmpty]: Start isEmpty. Operand 18618 states and 19156 transitions. [2024-10-10 23:40:05,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2024-10-10 23:40:05,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:05,675 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:40:05,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 23:40:05,675 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:05,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:05,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1029461183, now seen corresponding path program 1 times [2024-10-10 23:40:05,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:05,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392914563] [2024-10-10 23:40:05,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:05,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 581 proven. 269 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-10-10 23:40:06,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:06,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392914563] [2024-10-10 23:40:06,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392914563] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:40:06,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139741560] [2024-10-10 23:40:06,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:06,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:40:06,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:40:06,819 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:40:06,821 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:40:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:07,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:40:07,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:40:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2024-10-10 23:40:07,110 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:40:07,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139741560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:07,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:40:07,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:40:07,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734361381] [2024-10-10 23:40:07,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:07,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:07,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:07,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:07,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:40:07,113 INFO L87 Difference]: Start difference. First operand 18618 states and 19156 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:07,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:07,899 INFO L93 Difference]: Finished difference Result 41435 states and 42633 transitions. [2024-10-10 23:40:07,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:07,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 838 [2024-10-10 23:40:07,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:07,922 INFO L225 Difference]: With dead ends: 41435 [2024-10-10 23:40:07,922 INFO L226 Difference]: Without dead ends: 22519 [2024-10-10 23:40:07,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 841 GetRequests, 837 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:40:07,936 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 295 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:07,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 505 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:40:07,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22519 states. [2024-10-10 23:40:08,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22519 to 20416. [2024-10-10 23:40:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20416 states, 20415 states have (on average 1.0293411707078128) internal successors, (21014), 20415 states have internal predecessors, (21014), 0 states have call successors, (0), 0 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:40:08,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20416 states to 20416 states and 21014 transitions. [2024-10-10 23:40:08,151 INFO L78 Accepts]: Start accepts. Automaton has 20416 states and 21014 transitions. Word has length 838 [2024-10-10 23:40:08,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:08,151 INFO L471 AbstractCegarLoop]: Abstraction has 20416 states and 21014 transitions. [2024-10-10 23:40:08,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:08,151 INFO L276 IsEmpty]: Start isEmpty. Operand 20416 states and 21014 transitions. [2024-10-10 23:40:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2024-10-10 23:40:08,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:40:08,161 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:40:08,174 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:40:08,362 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,SelfDestructingSolverStorable21 [2024-10-10 23:40:08,362 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:40:08,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:40:08,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1934090592, now seen corresponding path program 1 times [2024-10-10 23:40:08,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:40:08,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912900024] [2024-10-10 23:40:08,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:08,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:40:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:09,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 655 proven. 269 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-10-10 23:40:09,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:40:09,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912900024] [2024-10-10 23:40:09,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912900024] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:40:09,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271089686] [2024-10-10 23:40:09,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:40:09,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:40:09,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:40:09,469 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:40:09,470 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:40:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:40:09,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 1009 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:40:09,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:40:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-10-10 23:40:11,506 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:40:11,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271089686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:40:11,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:40:11,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:40:11,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133071501] [2024-10-10 23:40:11,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:40:11,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:40:11,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:40:11,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:40:11,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:40:11,507 INFO L87 Difference]: Start difference. First operand 20416 states and 21014 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:12,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:40:12,265 INFO L93 Difference]: Finished difference Result 35414 states and 36345 transitions. [2024-10-10 23:40:12,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:40:12,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 875 [2024-10-10 23:40:12,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:40:12,267 INFO L225 Difference]: With dead ends: 35414 [2024-10-10 23:40:12,267 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:40:12,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 874 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:40:12,277 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 290 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:40:12,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 395 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:40:12,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:40:12,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:40:12,278 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:40:12,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:40:12,278 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 875 [2024-10-10 23:40:12,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:40:12,279 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:40:12,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:40:12,279 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:40:12,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:40:12,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:40:12,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-10 23:40:12,482 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,SelfDestructingSolverStorable22 [2024-10-10 23:40:12,485 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:40:12,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:40:14,731 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:40:14,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:40:14 BoogieIcfgContainer [2024-10-10 23:40:14,760 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:40:14,761 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:40:14,761 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:40:14,761 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:40:14,761 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:39:28" (3/4) ... [2024-10-10 23:40:14,763 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:40:14,791 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-10 23:40:14,792 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:40:14,794 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:40:14,795 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:40:14,961 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:40:14,962 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:40:14,962 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:40:14,963 INFO L158 Benchmark]: Toolchain (without parser) took 49534.81ms. Allocated memory was 180.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 107.5MB in the beginning and 636.7MB in the end (delta: -529.2MB). Peak memory consumption was 946.7MB. Max. memory is 16.1GB. [2024-10-10 23:40:14,963 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:40:14,963 INFO L158 Benchmark]: CACSL2BoogieTranslator took 846.80ms. Allocated memory is still 180.4MB. Free memory was 107.2MB in the beginning and 100.4MB in the end (delta: 6.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-10 23:40:14,964 INFO L158 Benchmark]: Boogie Procedure Inliner took 188.74ms. Allocated memory is still 180.4MB. Free memory was 100.4MB in the beginning and 124.5MB in the end (delta: -24.1MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2024-10-10 23:40:14,964 INFO L158 Benchmark]: Boogie Preprocessor took 165.21ms. Allocated memory is still 180.4MB. Free memory was 124.5MB in the beginning and 66.2MB in the end (delta: 58.3MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-10-10 23:40:14,964 INFO L158 Benchmark]: RCFGBuilder took 2235.02ms. Allocated memory was 180.4MB in the beginning and 291.5MB in the end (delta: 111.1MB). Free memory was 66.2MB in the beginning and 179.5MB in the end (delta: -113.3MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2024-10-10 23:40:14,965 INFO L158 Benchmark]: TraceAbstraction took 45889.88ms. Allocated memory was 291.5MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 178.5MB in the beginning and 662.9MB in the end (delta: -484.5MB). Peak memory consumption was 966.8MB. Max. memory is 16.1GB. [2024-10-10 23:40:14,965 INFO L158 Benchmark]: Witness Printer took 201.48ms. Allocated memory is still 1.7GB. Free memory was 662.9MB in the beginning and 636.7MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-10 23:40:14,966 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 846.80ms. Allocated memory is still 180.4MB. Free memory was 107.2MB in the beginning and 100.4MB in the end (delta: 6.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 188.74ms. Allocated memory is still 180.4MB. Free memory was 100.4MB in the beginning and 124.5MB in the end (delta: -24.1MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 165.21ms. Allocated memory is still 180.4MB. Free memory was 124.5MB in the beginning and 66.2MB in the end (delta: 58.3MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2235.02ms. Allocated memory was 180.4MB in the beginning and 291.5MB in the end (delta: 111.1MB). Free memory was 66.2MB in the beginning and 179.5MB in the end (delta: -113.3MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. * TraceAbstraction took 45889.88ms. Allocated memory was 291.5MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 178.5MB in the beginning and 662.9MB in the end (delta: -484.5MB). Peak memory consumption was 966.8MB. Max. memory is 16.1GB. * Witness Printer took 201.48ms. Allocated memory is still 1.7GB. Free memory was 662.9MB in the beginning and 636.7MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 116]: 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, 362 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.6s, OverallIterations: 23, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 27.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6594 SdHoareTripleChecker+Valid, 24.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6594 mSDsluCounter, 10080 SdHoareTripleChecker+Invalid, 21.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 807 mSDsCounter, 3774 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21651 IncrementalHoareTripleChecker+Invalid, 25425 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3774 mSolverCounterUnsat, 9273 mSDtfsCounter, 21651 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3484 GetRequests, 3444 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20416occurred in iteration=22, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 19509 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 14143 NumberOfCodeBlocks, 14143 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 14115 ConstructedInterpolants, 0 QuantifiedInterpolants, 46919 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4117 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 28 InterpolantComputations, 23 PerfectInterpolantSequences, 15511/16166 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (3 == a2)) || (((((long long) 89 + a4) <= 0) && (0 <= ((long long) a0 + 60))) && (5 <= a2))) || (((((long long) 89 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (5 <= a2))) || (((((((long long) a0 + 105) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (a2 == 4))) || (((((long long) 89 + a4) <= 0) && (5 <= a2)) && (0 <= ((long long) a29 + 13)))) || ((((((long long) 42 + a4) <= 0) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && (5 <= a2))) || (((((long long) 98 + a0) <= 0) && (0 <= ((long long) 146 + a0))) && ((((((long long) a0 + 105) <= 0) && (((long long) 42 + a4) <= 0)) && (5 <= a2)) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (5 <= a2))))) || ((2 == a2) && (((long long) 89 + a4) <= 0))) || (((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) a29 + 13)))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (5 <= a2))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0))) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a29 + 127) <= 0))) || ((((a2 == 1) && (((long long) a0 + 61) <= 0)) || ((0 <= ((long long) a4 + 85)) && (a2 == 1))) && (((long long) 42 + a4) <= 0))) || ((((long long) 89 + a4) <= 0) && (3 == a2))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (5 <= a2)) && (0 <= ((long long) a29 + 13))) && (((long long) a0 + 61) <= 0))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (a2 == 4))) || (((((long long) a0 + 105) <= 0) && (2 == a2)) && (44 <= a29))) || ((((long long) 89 + a4) <= 0) && (a2 == 4))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:40:14,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE