./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label17.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label17.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a55417a97b6239a405a0dcf0983ee9e4456c0351375b5342395e4dcb7a46d5dd --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:10:50,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:10:50,708 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:10:50,711 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:10:50,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:10:50,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:10:50,727 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:10:50,727 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:10:50,727 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:10:50,727 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:10:50,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:10:50,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:10:50,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:10:50,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:10:50,729 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:10:50,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:10:50,731 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:10:50,732 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:10:50,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:10:50,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:10:50,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:10:50,735 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:10:50,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:10:50,736 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:10:50,736 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:10:50,736 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:10:50,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:10:50,736 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:10:50,736 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:10:50,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:10:50,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:10:50,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:10:50,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:10:50,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:10:50,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:10:50,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:10:50,738 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:10:50,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:10:50,738 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:10:50,738 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:10:50,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:10:50,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:10:50,739 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a55417a97b6239a405a0dcf0983ee9e4456c0351375b5342395e4dcb7a46d5dd [2024-11-08 11:10:50,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:10:50,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:10:50,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:10:50,939 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:10:50,940 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:10:50,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label17.c [2024-11-08 11:10:52,227 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:10:52,462 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:10:52,463 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label17.c [2024-11-08 11:10:52,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f864e09f7/85a96e62e4a84b75badb53c4fa5723f0/FLAG4cc17bc1b [2024-11-08 11:10:52,800 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f864e09f7/85a96e62e4a84b75badb53c4fa5723f0 [2024-11-08 11:10:52,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:10:52,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:10:52,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:10:52,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:10:52,809 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:10:52,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:10:52" (1/1) ... [2024-11-08 11:10:52,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@449ebef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:52, skipping insertion in model container [2024-11-08 11:10:52,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:10:52" (1/1) ... [2024-11-08 11:10:52,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:10:53,086 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label17.c[5541,5554] [2024-11-08 11:10:53,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:10:53,276 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:10:53,298 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label17.c[5541,5554] [2024-11-08 11:10:53,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:10:53,416 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:10:53,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:53 WrapperNode [2024-11-08 11:10:53,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:10:53,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:10:53,419 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:10:53,419 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:10:53,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:53" (1/1) ... [2024-11-08 11:10:53,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:53" (1/1) ... [2024-11-08 11:10:53,532 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-08 11:10:53,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:10:53,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:10:53,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:10:53,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:10:53,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:53" (1/1) ... [2024-11-08 11:10:53,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:53" (1/1) ... [2024-11-08 11:10:53,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:53" (1/1) ... [2024-11-08 11:10:53,615 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 11:10:53,615 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:53" (1/1) ... [2024-11-08 11:10:53,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:53" (1/1) ... [2024-11-08 11:10:53,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:53" (1/1) ... [2024-11-08 11:10:53,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:53" (1/1) ... [2024-11-08 11:10:53,680 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:53" (1/1) ... [2024-11-08 11:10:53,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:53" (1/1) ... [2024-11-08 11:10:53,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:10:53,700 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:10:53,700 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:10:53,700 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:10:53,701 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:53" (1/1) ... [2024-11-08 11:10:53,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:10:53,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:10:53,725 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:10:53,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 11:10:53,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:10:53,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:10:53,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:10:53,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:10:53,815 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:10:53,816 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:10:54,960 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-08 11:10:54,960 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:10:54,972 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:10:54,972 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:10:54,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:10:54 BoogieIcfgContainer [2024-11-08 11:10:54,973 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:10:54,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:10:54,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:10:54,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:10:54,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:10:52" (1/3) ... [2024-11-08 11:10:54,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e2c357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:10:54, skipping insertion in model container [2024-11-08 11:10:54,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:10:53" (2/3) ... [2024-11-08 11:10:54,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e2c357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:10:54, skipping insertion in model container [2024-11-08 11:10:54,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:10:54" (3/3) ... [2024-11-08 11:10:54,978 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label17.c [2024-11-08 11:10:54,996 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:10:54,996 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:10:55,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:10:55,093 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;@5e3f5b06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:10:55,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:10:55,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 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-11-08 11:10:55,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 11:10:55,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:55,119 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:55,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:55,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:55,127 INFO L85 PathProgramCache]: Analyzing trace with hash 323974986, now seen corresponding path program 1 times [2024-11-08 11:10:55,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:55,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574682998] [2024-11-08 11:10:55,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:55,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:55,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:55,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:55,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574682998] [2024-11-08 11:10:55,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574682998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:55,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:55,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:10:55,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918675764] [2024-11-08 11:10:55,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:55,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:55,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:55,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:55,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:55,517 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 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) Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:56,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:56,351 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2024-11-08 11:10:56,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:56,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-11-08 11:10:56,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:56,362 INFO L225 Difference]: With dead ends: 776 [2024-11-08 11:10:56,362 INFO L226 Difference]: Without dead ends: 413 [2024-11-08 11:10:56,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:56,370 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 189 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:56,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 196 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:10:56,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-08 11:10:56,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2024-11-08 11:10:56,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:56,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2024-11-08 11:10:56,422 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 38 [2024-11-08 11:10:56,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:56,423 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2024-11-08 11:10:56,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:56,423 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2024-11-08 11:10:56,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 11:10:56,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:56,426 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:56,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:10:56,426 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:56,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:56,427 INFO L85 PathProgramCache]: Analyzing trace with hash -980853214, now seen corresponding path program 1 times [2024-11-08 11:10:56,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:56,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871388684] [2024-11-08 11:10:56,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:56,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:56,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:56,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871388684] [2024-11-08 11:10:56,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871388684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:56,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:56,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:10:56,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132644029] [2024-11-08 11:10:56,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:56,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:56,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:56,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:56,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:56,570 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:57,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:57,171 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2024-11-08 11:10:57,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:57,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2024-11-08 11:10:57,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:57,174 INFO L225 Difference]: With dead ends: 1209 [2024-11-08 11:10:57,175 INFO L226 Difference]: Without dead ends: 800 [2024-11-08 11:10:57,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:57,176 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:57,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 122 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:10:57,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-08 11:10:57,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2024-11-08 11:10:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3842239185750635) internal successors, (1088), 786 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:57,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1088 transitions. [2024-11-08 11:10:57,195 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1088 transitions. Word has length 106 [2024-11-08 11:10:57,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:57,195 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1088 transitions. [2024-11-08 11:10:57,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:57,196 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1088 transitions. [2024-11-08 11:10:57,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 11:10:57,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:57,197 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:57,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:10:57,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:57,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:57,198 INFO L85 PathProgramCache]: Analyzing trace with hash 952313213, now seen corresponding path program 1 times [2024-11-08 11:10:57,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:57,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205045882] [2024-11-08 11:10:57,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:57,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:57,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:57,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205045882] [2024-11-08 11:10:57,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205045882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:57,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:57,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:10:57,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322269318] [2024-11-08 11:10:57,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:57,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:57,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:57,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:57,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:57,526 INFO L87 Difference]: Start difference. First operand 787 states and 1088 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:58,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:58,108 INFO L93 Difference]: Finished difference Result 1942 states and 2629 transitions. [2024-11-08 11:10:58,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:58,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2024-11-08 11:10:58,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:58,112 INFO L225 Difference]: With dead ends: 1942 [2024-11-08 11:10:58,112 INFO L226 Difference]: Without dead ends: 1157 [2024-11-08 11:10:58,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:58,114 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:58,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:10:58,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-11-08 11:10:58,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2024-11-08 11:10:58,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.277056277056277) internal successors, (1475), 1155 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1475 transitions. [2024-11-08 11:10:58,149 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1475 transitions. Word has length 108 [2024-11-08 11:10:58,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:58,150 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1475 transitions. [2024-11-08 11:10:58,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1475 transitions. [2024-11-08 11:10:58,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 11:10:58,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:58,155 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:58,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:10:58,158 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:58,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:58,159 INFO L85 PathProgramCache]: Analyzing trace with hash 893192678, now seen corresponding path program 1 times [2024-11-08 11:10:58,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:58,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926091348] [2024-11-08 11:10:58,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:58,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:58,324 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-08 11:10:58,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:58,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926091348] [2024-11-08 11:10:58,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926091348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:58,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:58,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:10:58,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616449273] [2024-11-08 11:10:58,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:58,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:58,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:58,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:58,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:58,330 INFO L87 Difference]: Start difference. First operand 1156 states and 1475 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:59,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:10:59,052 INFO L93 Difference]: Finished difference Result 2502 states and 3336 transitions. [2024-11-08 11:10:59,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:10:59,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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 150 [2024-11-08 11:10:59,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:10:59,058 INFO L225 Difference]: With dead ends: 2502 [2024-11-08 11:10:59,058 INFO L226 Difference]: Without dead ends: 1532 [2024-11-08 11:10:59,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:59,062 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:10:59,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 156 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:10:59,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-11-08 11:10:59,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1532. [2024-11-08 11:10:59,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 1.2612671456564337) internal successors, (1931), 1531 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:59,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1931 transitions. [2024-11-08 11:10:59,082 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1931 transitions. Word has length 150 [2024-11-08 11:10:59,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:10:59,083 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 1931 transitions. [2024-11-08 11:10:59,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:10:59,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1931 transitions. [2024-11-08 11:10:59,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 11:10:59,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:10:59,087 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:10:59,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:10:59,088 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:10:59,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:10:59,088 INFO L85 PathProgramCache]: Analyzing trace with hash -415130689, now seen corresponding path program 1 times [2024-11-08 11:10:59,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:10:59,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670375112] [2024-11-08 11:10:59,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:10:59,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:10:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:10:59,221 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:10:59,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:10:59,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670375112] [2024-11-08 11:10:59,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670375112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:10:59,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:10:59,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:10:59,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917113147] [2024-11-08 11:10:59,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:10:59,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:10:59,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:10:59,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:10:59,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:10:59,227 INFO L87 Difference]: Start difference. First operand 1532 states and 1931 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:00,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:00,023 INFO L93 Difference]: Finished difference Result 3644 states and 4735 transitions. [2024-11-08 11:11:00,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:00,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2024-11-08 11:11:00,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:00,029 INFO L225 Difference]: With dead ends: 3644 [2024-11-08 11:11:00,029 INFO L226 Difference]: Without dead ends: 2298 [2024-11-08 11:11:00,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:00,033 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 197 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:00,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:11:00,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2024-11-08 11:11:00,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 2295. [2024-11-08 11:11:00,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2295 states, 2294 states have (on average 1.2650392327811684) internal successors, (2902), 2294 states have internal predecessors, (2902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:00,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 2902 transitions. [2024-11-08 11:11:00,067 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 2902 transitions. Word has length 165 [2024-11-08 11:11:00,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:00,068 INFO L471 AbstractCegarLoop]: Abstraction has 2295 states and 2902 transitions. [2024-11-08 11:11:00,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:00,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 2902 transitions. [2024-11-08 11:11:00,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-08 11:11:00,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:00,070 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:11:00,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:11:00,071 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:00,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:00,071 INFO L85 PathProgramCache]: Analyzing trace with hash -406031591, now seen corresponding path program 1 times [2024-11-08 11:11:00,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:00,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660988668] [2024-11-08 11:11:00,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:00,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 11:11:00,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:00,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660988668] [2024-11-08 11:11:00,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660988668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:00,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:00,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:11:00,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828942190] [2024-11-08 11:11:00,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:00,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:00,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:00,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:00,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:00,273 INFO L87 Difference]: Start difference. First operand 2295 states and 2902 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:00,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:00,893 INFO L93 Difference]: Finished difference Result 5522 states and 7084 transitions. [2024-11-08 11:11:00,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:00,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220 [2024-11-08 11:11:00,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:00,901 INFO L225 Difference]: With dead ends: 5522 [2024-11-08 11:11:00,901 INFO L226 Difference]: Without dead ends: 3413 [2024-11-08 11:11:00,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:00,903 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 159 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:00,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 392 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:11:00,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3413 states. [2024-11-08 11:11:00,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3413 to 3216. [2024-11-08 11:11:00,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3216 states, 3215 states have (on average 1.2320373250388803) internal successors, (3961), 3215 states have internal predecessors, (3961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 3216 states and 3961 transitions. [2024-11-08 11:11:00,938 INFO L78 Accepts]: Start accepts. Automaton has 3216 states and 3961 transitions. Word has length 220 [2024-11-08 11:11:00,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:00,938 INFO L471 AbstractCegarLoop]: Abstraction has 3216 states and 3961 transitions. [2024-11-08 11:11:00,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:00,938 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 3961 transitions. [2024-11-08 11:11:00,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-08 11:11:00,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:00,940 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:11:00,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:11:00,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:00,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:00,941 INFO L85 PathProgramCache]: Analyzing trace with hash 379079722, now seen corresponding path program 1 times [2024-11-08 11:11:00,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:00,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744247290] [2024-11-08 11:11:00,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:00,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:01,081 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-08 11:11:01,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:01,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744247290] [2024-11-08 11:11:01,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744247290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:01,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:01,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:11:01,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707320229] [2024-11-08 11:11:01,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:01,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:01,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:01,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:01,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:01,084 INFO L87 Difference]: Start difference. First operand 3216 states and 3961 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:01,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:01,685 INFO L93 Difference]: Finished difference Result 8087 states and 10094 transitions. [2024-11-08 11:11:01,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:01,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226 [2024-11-08 11:11:01,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:01,698 INFO L225 Difference]: With dead ends: 8087 [2024-11-08 11:11:01,698 INFO L226 Difference]: Without dead ends: 4873 [2024-11-08 11:11:01,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:01,703 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 173 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:01,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 144 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:11:01,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2024-11-08 11:11:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 4873. [2024-11-08 11:11:01,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4873 states, 4872 states have (on average 1.2270114942528736) internal successors, (5978), 4872 states have internal predecessors, (5978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4873 states to 4873 states and 5978 transitions. [2024-11-08 11:11:01,755 INFO L78 Accepts]: Start accepts. Automaton has 4873 states and 5978 transitions. Word has length 226 [2024-11-08 11:11:01,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:01,755 INFO L471 AbstractCegarLoop]: Abstraction has 4873 states and 5978 transitions. [2024-11-08 11:11:01,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:01,756 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5978 transitions. [2024-11-08 11:11:01,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-08 11:11:01,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:01,759 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:11:01,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:11:01,759 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:01,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:01,760 INFO L85 PathProgramCache]: Analyzing trace with hash -596698309, now seen corresponding path program 1 times [2024-11-08 11:11:01,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:01,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445435965] [2024-11-08 11:11:01,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:01,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:01,948 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-08 11:11:01,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:01,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445435965] [2024-11-08 11:11:01,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445435965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:01,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:01,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:11:01,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878187450] [2024-11-08 11:11:01,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:01,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:01,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:01,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:01,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:01,952 INFO L87 Difference]: Start difference. First operand 4873 states and 5978 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:02,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:02,578 INFO L93 Difference]: Finished difference Result 11043 states and 13689 transitions. [2024-11-08 11:11:02,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:02,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 257 [2024-11-08 11:11:02,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:02,591 INFO L225 Difference]: With dead ends: 11043 [2024-11-08 11:11:02,592 INFO L226 Difference]: Without dead ends: 6172 [2024-11-08 11:11:02,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:02,597 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 158 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:02,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 391 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:11:02,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6172 states. [2024-11-08 11:11:02,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6172 to 6162. [2024-11-08 11:11:02,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6162 states, 6161 states have (on average 1.2114916409673755) internal successors, (7464), 6161 states have internal predecessors, (7464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:02,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6162 states to 6162 states and 7464 transitions. [2024-11-08 11:11:02,661 INFO L78 Accepts]: Start accepts. Automaton has 6162 states and 7464 transitions. Word has length 257 [2024-11-08 11:11:02,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:02,662 INFO L471 AbstractCegarLoop]: Abstraction has 6162 states and 7464 transitions. [2024-11-08 11:11:02,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:02,662 INFO L276 IsEmpty]: Start isEmpty. Operand 6162 states and 7464 transitions. [2024-11-08 11:11:02,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2024-11-08 11:11:02,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:02,667 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:11:02,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:11:02,667 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:02,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:02,668 INFO L85 PathProgramCache]: Analyzing trace with hash -815039662, now seen corresponding path program 1 times [2024-11-08 11:11:02,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:02,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153729696] [2024-11-08 11:11:02,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:02,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-11-08 11:11:02,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:02,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153729696] [2024-11-08 11:11:02,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153729696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:02,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:02,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:11:02,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85488138] [2024-11-08 11:11:02,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:02,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:02,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:02,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:02,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:02,857 INFO L87 Difference]: Start difference. First operand 6162 states and 7464 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:03,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:03,491 INFO L93 Difference]: Finished difference Result 13985 states and 17099 transitions. [2024-11-08 11:11:03,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:03,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 303 [2024-11-08 11:11:03,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:03,507 INFO L225 Difference]: With dead ends: 13985 [2024-11-08 11:11:03,507 INFO L226 Difference]: Without dead ends: 7825 [2024-11-08 11:11:03,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:03,513 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 198 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:03,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 60 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:11:03,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7825 states. [2024-11-08 11:11:03,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7825 to 7819. [2024-11-08 11:11:03,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7819 states, 7818 states have (on average 1.2196213865438732) internal successors, (9535), 7818 states have internal predecessors, (9535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:03,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7819 states to 7819 states and 9535 transitions. [2024-11-08 11:11:03,591 INFO L78 Accepts]: Start accepts. Automaton has 7819 states and 9535 transitions. Word has length 303 [2024-11-08 11:11:03,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:03,591 INFO L471 AbstractCegarLoop]: Abstraction has 7819 states and 9535 transitions. [2024-11-08 11:11:03,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:03,591 INFO L276 IsEmpty]: Start isEmpty. Operand 7819 states and 9535 transitions. [2024-11-08 11:11:03,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-11-08 11:11:03,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:03,598 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:11:03,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:11:03,599 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:03,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:03,599 INFO L85 PathProgramCache]: Analyzing trace with hash 776789019, now seen corresponding path program 1 times [2024-11-08 11:11:03,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:03,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593714212] [2024-11-08 11:11:03,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:03,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:03,805 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-08 11:11:03,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:03,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593714212] [2024-11-08 11:11:03,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593714212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:03,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:03,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:11:03,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33993645] [2024-11-08 11:11:03,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:03,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:03,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:03,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:03,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:03,809 INFO L87 Difference]: Start difference. First operand 7819 states and 9535 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:04,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:04,382 INFO L93 Difference]: Finished difference Result 15237 states and 18590 transitions. [2024-11-08 11:11:04,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:04,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 338 [2024-11-08 11:11:04,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:04,392 INFO L225 Difference]: With dead ends: 15237 [2024-11-08 11:11:04,392 INFO L226 Difference]: Without dead ends: 7420 [2024-11-08 11:11:04,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:04,398 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 121 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:04,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 150 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:11:04,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7420 states. [2024-11-08 11:11:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7420 to 7051. [2024-11-08 11:11:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7051 states, 7050 states have (on average 1.1554609929078015) internal successors, (8146), 7050 states have internal predecessors, (8146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:04,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7051 states to 7051 states and 8146 transitions. [2024-11-08 11:11:04,461 INFO L78 Accepts]: Start accepts. Automaton has 7051 states and 8146 transitions. Word has length 338 [2024-11-08 11:11:04,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:04,461 INFO L471 AbstractCegarLoop]: Abstraction has 7051 states and 8146 transitions. [2024-11-08 11:11:04,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:04,461 INFO L276 IsEmpty]: Start isEmpty. Operand 7051 states and 8146 transitions. [2024-11-08 11:11:04,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2024-11-08 11:11:04,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:04,469 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:11:04,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:11:04,469 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:04,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:04,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1032835470, now seen corresponding path program 1 times [2024-11-08 11:11:04,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:04,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074263129] [2024-11-08 11:11:04,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:04,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:11:04,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:04,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074263129] [2024-11-08 11:11:04,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074263129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:04,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:04,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:11:04,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934026784] [2024-11-08 11:11:04,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:04,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:11:04,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:04,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:11:04,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:11:04,776 INFO L87 Difference]: Start difference. First operand 7051 states and 8146 transitions. Second operand has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:05,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:05,825 INFO L93 Difference]: Finished difference Result 16680 states and 19252 transitions. [2024-11-08 11:11:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:11:05,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 343 [2024-11-08 11:11:05,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:05,836 INFO L225 Difference]: With dead ends: 16680 [2024-11-08 11:11:05,836 INFO L226 Difference]: Without dead ends: 9631 [2024-11-08 11:11:05,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:11:05,841 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 247 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:05,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 63 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:11:05,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9631 states. [2024-11-08 11:11:05,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9631 to 7782. [2024-11-08 11:11:05,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7782 states, 7781 states have (on average 1.1453540676005656) internal successors, (8912), 7781 states have internal predecessors, (8912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:05,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7782 states to 7782 states and 8912 transitions. [2024-11-08 11:11:05,930 INFO L78 Accepts]: Start accepts. Automaton has 7782 states and 8912 transitions. Word has length 343 [2024-11-08 11:11:05,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:05,930 INFO L471 AbstractCegarLoop]: Abstraction has 7782 states and 8912 transitions. [2024-11-08 11:11:05,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:05,931 INFO L276 IsEmpty]: Start isEmpty. Operand 7782 states and 8912 transitions. [2024-11-08 11:11:05,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2024-11-08 11:11:05,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:05,941 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:11:05,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 11:11:05,941 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:05,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:05,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1279990241, now seen corresponding path program 1 times [2024-11-08 11:11:05,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:05,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296054134] [2024-11-08 11:11:05,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:05,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:06,294 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-08 11:11:06,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:06,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296054134] [2024-11-08 11:11:06,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296054134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:06,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:06,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:11:06,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112230144] [2024-11-08 11:11:06,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:06,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:11:06,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:06,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:11:06,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:11:06,297 INFO L87 Difference]: Start difference. First operand 7782 states and 8912 transitions. Second operand has 4 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:07,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:07,242 INFO L93 Difference]: Finished difference Result 16852 states and 19276 transitions. [2024-11-08 11:11:07,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:11:07,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 0 states have call successors, (0), 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 417 [2024-11-08 11:11:07,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:07,252 INFO L225 Difference]: With dead ends: 16852 [2024-11-08 11:11:07,252 INFO L226 Difference]: Without dead ends: 9072 [2024-11-08 11:11:07,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:11:07,257 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 246 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:07,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 64 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 11:11:07,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9072 states. [2024-11-08 11:11:07,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9072 to 7414. [2024-11-08 11:11:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7414 states, 7413 states have (on average 1.1452853095912585) internal successors, (8490), 7413 states have internal predecessors, (8490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:07,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7414 states to 7414 states and 8490 transitions. [2024-11-08 11:11:07,317 INFO L78 Accepts]: Start accepts. Automaton has 7414 states and 8490 transitions. Word has length 417 [2024-11-08 11:11:07,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:07,317 INFO L471 AbstractCegarLoop]: Abstraction has 7414 states and 8490 transitions. [2024-11-08 11:11:07,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:07,317 INFO L276 IsEmpty]: Start isEmpty. Operand 7414 states and 8490 transitions. [2024-11-08 11:11:07,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2024-11-08 11:11:07,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:11:07,326 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:11:07,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 11:11:07,326 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:11:07,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:11:07,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1984851719, now seen corresponding path program 1 times [2024-11-08 11:11:07,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:11:07,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713576661] [2024-11-08 11:11:07,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:11:07,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:11:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:11:07,589 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 470 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-08 11:11:07,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:11:07,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713576661] [2024-11-08 11:11:07,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713576661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:11:07,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:11:07,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:11:07,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572414749] [2024-11-08 11:11:07,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:11:07,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:11:07,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:11:07,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:11:07,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:07,592 INFO L87 Difference]: Start difference. First operand 7414 states and 8490 transitions. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:08,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:11:08,193 INFO L93 Difference]: Finished difference Result 16111 states and 18455 transitions. [2024-11-08 11:11:08,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:11:08,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 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 536 [2024-11-08 11:11:08,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:11:08,194 INFO L225 Difference]: With dead ends: 16111 [2024-11-08 11:11:08,194 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:11:08,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:11:08,202 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 193 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:11:08,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 355 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:11:08,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:11:08,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:11:08,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:08,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:11:08,204 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 536 [2024-11-08 11:11:08,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:11:08,204 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:11:08,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:11:08,204 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:11:08,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:11:08,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:11:08,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 11:11:08,209 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:11:08,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:11:08,650 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:11:08,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:11:08 BoogieIcfgContainer [2024-11-08 11:11:08,670 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:11:08,670 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:11:08,670 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:11:08,670 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:11:08,671 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:10:54" (3/4) ... [2024-11-08 11:11:08,672 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:11:08,694 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 11:11:08,695 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:11:08,695 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:11:08,696 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:11:08,839 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:11:08,839 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:11:08,839 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:11:08,840 INFO L158 Benchmark]: Toolchain (without parser) took 16037.30ms. Allocated memory was 178.3MB in the beginning and 599.8MB in the end (delta: 421.5MB). Free memory was 100.9MB in the beginning and 500.5MB in the end (delta: -399.6MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2024-11-08 11:11:08,841 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 178.3MB. Free memory is still 129.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:11:08,841 INFO L158 Benchmark]: CACSL2BoogieTranslator took 614.13ms. Allocated memory was 178.3MB in the beginning and 255.9MB in the end (delta: 77.6MB). Free memory was 100.7MB in the beginning and 191.4MB in the end (delta: -90.8MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2024-11-08 11:11:08,841 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.54ms. Allocated memory is still 255.9MB. Free memory was 191.4MB in the beginning and 173.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 11:11:08,842 INFO L158 Benchmark]: Boogie Preprocessor took 166.03ms. Allocated memory is still 255.9MB. Free memory was 173.6MB in the beginning and 148.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 11:11:08,842 INFO L158 Benchmark]: RCFGBuilder took 1272.84ms. Allocated memory is still 255.9MB. Free memory was 148.5MB in the beginning and 111.4MB in the end (delta: 37.0MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. [2024-11-08 11:11:08,842 INFO L158 Benchmark]: TraceAbstraction took 13695.60ms. Allocated memory was 255.9MB in the beginning and 599.8MB in the end (delta: 343.9MB). Free memory was 110.4MB in the beginning and 517.3MB in the end (delta: -406.9MB). Peak memory consumption was 263.1MB. Max. memory is 16.1GB. [2024-11-08 11:11:08,843 INFO L158 Benchmark]: Witness Printer took 169.33ms. Allocated memory is still 599.8MB. Free memory was 517.3MB in the beginning and 500.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 11:11:08,844 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.16ms. Allocated memory is still 178.3MB. Free memory is still 129.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 614.13ms. Allocated memory was 178.3MB in the beginning and 255.9MB in the end (delta: 77.6MB). Free memory was 100.7MB in the beginning and 191.4MB in the end (delta: -90.8MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.54ms. Allocated memory is still 255.9MB. Free memory was 191.4MB in the beginning and 173.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 166.03ms. Allocated memory is still 255.9MB. Free memory was 173.6MB in the beginning and 148.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1272.84ms. Allocated memory is still 255.9MB. Free memory was 148.5MB in the beginning and 111.4MB in the end (delta: 37.0MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13695.60ms. Allocated memory was 255.9MB in the beginning and 599.8MB in the end (delta: 343.9MB). Free memory was 110.4MB in the beginning and 517.3MB in the end (delta: -406.9MB). Peak memory consumption was 263.1MB. Max. memory is 16.1GB. * Witness Printer took 169.33ms. Allocated memory is still 599.8MB. Free memory was 517.3MB in the beginning and 500.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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: 130]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.2s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2250 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2250 mSDsluCounter, 2605 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 298 mSDsCounter, 1516 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8270 IncrementalHoareTripleChecker+Invalid, 9786 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1516 mSolverCounterUnsat, 2307 mSDtfsCounter, 8270 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7819occurred in iteration=9, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 4108 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 3207 NumberOfCodeBlocks, 3207 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3194 ConstructedInterpolants, 0 QuantifiedInterpolants, 5658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2651/2651 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: 1044]: Loop Invariant Derived loop invariant: (((((((((a25 == 13) && (a29 <= 599998)) && (a4 == 1)) || ((a29 <= 277) && (a4 == 0))) || (((a25 == 11) && (a29 <= 599999)) && (a4 == 1))) || ((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 <= 10)) && (a29 <= 599998))) || ((a29 <= 277) && (a4 == 1))) || (((a25 <= 10) && (a29 <= 599999)) && (a4 == 1))) || (((a4 == 0) && (a25 == 11)) && (a29 <= 599998))) RESULT: Ultimate proved your program to be correct! [2024-11-08 11:11:08,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE