./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label08.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/Problem10_label08.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 83ba8dc0b26e7572bb3969c6f3d087c218a7cd98d221b81c07246f42fbf2250b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:19:36,043 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:19:36,103 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:19:36,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:19:36,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:19:36,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:19:36,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:19:36,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:19:36,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:19:36,138 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:19:36,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:19:36,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:19:36,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:19:36,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:19:36,140 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:19:36,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:19:36,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:19:36,142 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:19:36,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:19:36,143 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:19:36,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:19:36,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:19:36,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:19:36,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:19:36,148 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:19:36,148 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:19:36,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:19:36,148 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:19:36,148 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:19:36,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:19:36,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:19:36,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:19:36,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:19:36,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:19:36,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:19:36,150 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:19:36,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:19:36,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:19:36,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:19:36,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:19:36,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:19:36,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:19:36,151 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 -> 83ba8dc0b26e7572bb3969c6f3d087c218a7cd98d221b81c07246f42fbf2250b [2024-11-09 19:19:36,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:19:36,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:19:36,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:19:36,360 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:19:36,361 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:19:36,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label08.c [2024-11-09 19:19:37,759 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:19:37,973 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:19:37,973 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label08.c [2024-11-09 19:19:37,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbbc4d1df/babab4e1c7d3474284be4ec42fe56e4e/FLAG3f504f292 [2024-11-09 19:19:38,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbbc4d1df/babab4e1c7d3474284be4ec42fe56e4e [2024-11-09 19:19:38,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:19:38,022 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:19:38,023 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:19:38,023 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:19:38,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:19:38,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:19:38" (1/1) ... [2024-11-09 19:19:38,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df8dedd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:38, skipping insertion in model container [2024-11-09 19:19:38,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:19:38" (1/1) ... [2024-11-09 19:19:38,074 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:19:38,249 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/Problem10_label08.c[4672,4685] [2024-11-09 19:19:38,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:19:38,487 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:19:38,509 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/Problem10_label08.c[4672,4685] [2024-11-09 19:19:38,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:19:38,575 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:19:38,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:38 WrapperNode [2024-11-09 19:19:38,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:19:38,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:19:38,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:19:38,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:19:38,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:38" (1/1) ... [2024-11-09 19:19:38,600 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:38" (1/1) ... [2024-11-09 19:19:38,651 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 597 [2024-11-09 19:19:38,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:19:38,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:19:38,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:19:38,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:19:38,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:38" (1/1) ... [2024-11-09 19:19:38,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:38" (1/1) ... [2024-11-09 19:19:38,671 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:38" (1/1) ... [2024-11-09 19:19:38,708 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-09 19:19:38,708 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:38" (1/1) ... [2024-11-09 19:19:38,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:38" (1/1) ... [2024-11-09 19:19:38,735 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:38" (1/1) ... [2024-11-09 19:19:38,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:38" (1/1) ... [2024-11-09 19:19:38,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:38" (1/1) ... [2024-11-09 19:19:38,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:38" (1/1) ... [2024-11-09 19:19:38,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:19:38,758 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:19:38,761 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:19:38,761 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:19:38,762 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:38" (1/1) ... [2024-11-09 19:19:38,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:19:38,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:19:38,789 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-09 19:19:38,792 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-09 19:19:38,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:19:38,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:19:38,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:19:38,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:19:38,881 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:19:38,883 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:19:39,857 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2024-11-09 19:19:39,858 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:19:39,875 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:19:39,878 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:19:39,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:19:39 BoogieIcfgContainer [2024-11-09 19:19:39,878 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:19:39,880 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:19:39,880 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:19:39,883 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:19:39,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:19:38" (1/3) ... [2024-11-09 19:19:39,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1cac2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:19:39, skipping insertion in model container [2024-11-09 19:19:39,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:38" (2/3) ... [2024-11-09 19:19:39,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1cac2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:19:39, skipping insertion in model container [2024-11-09 19:19:39,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:19:39" (3/3) ... [2024-11-09 19:19:39,885 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label08.c [2024-11-09 19:19:39,898 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:19:39,899 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:19:39,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:19:39,958 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;@33d84fbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:19:39,959 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:19:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 207 states have (on average 2.033816425120773) internal successors, (421), 208 states have internal predecessors, (421), 0 states have call successors, (0), 0 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-09 19:19:39,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 19:19:39,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:19:39,972 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:19:39,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:19:39,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:19:39,977 INFO L85 PathProgramCache]: Analyzing trace with hash -547691643, now seen corresponding path program 1 times [2024-11-09 19:19:39,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:19:39,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276743710] [2024-11-09 19:19:39,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:39,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:19:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:19:40,347 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-09 19:19:40,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:19:40,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276743710] [2024-11-09 19:19:40,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276743710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:19:40,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:19:40,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:19:40,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072521077] [2024-11-09 19:19:40,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:19:40,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:19:40,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:19:40,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:19:40,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:19:40,393 INFO L87 Difference]: Start difference. First operand has 209 states, 207 states have (on average 2.033816425120773) internal successors, (421), 208 states have internal predecessors, (421), 0 states have call successors, (0), 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 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-09 19:19:41,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:19:41,559 INFO L93 Difference]: Finished difference Result 558 states and 1194 transitions. [2024-11-09 19:19:41,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:19:41,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-11-09 19:19:41,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:19:41,581 INFO L225 Difference]: With dead ends: 558 [2024-11-09 19:19:41,581 INFO L226 Difference]: Without dead ends: 285 [2024-11-09 19:19:41,586 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-09 19:19:41,590 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 222 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:19:41,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 80 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:19:41,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-09 19:19:41,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-11-09 19:19:41,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 2.0528169014084505) internal successors, (583), 284 states have internal predecessors, (583), 0 states have call successors, (0), 0 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-09 19:19:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 583 transitions. [2024-11-09 19:19:41,677 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 583 transitions. Word has length 42 [2024-11-09 19:19:41,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:19:41,678 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 583 transitions. [2024-11-09 19:19:41,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-09 19:19:41,679 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 583 transitions. [2024-11-09 19:19:41,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 19:19:41,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:19:41,687 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:19:41,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:19:41,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:19:41,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:19:41,688 INFO L85 PathProgramCache]: Analyzing trace with hash -95468491, now seen corresponding path program 1 times [2024-11-09 19:19:41,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:19:41,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422689164] [2024-11-09 19:19:41,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:41,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:19:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:19:42,023 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:19:42,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:19:42,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422689164] [2024-11-09 19:19:42,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422689164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:19:42,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:19:42,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:19:42,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570665463] [2024-11-09 19:19:42,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:19:42,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:19:42,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:19:42,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:19:42,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:19:42,034 INFO L87 Difference]: Start difference. First operand 285 states and 583 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 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-09 19:19:42,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:19:42,798 INFO L93 Difference]: Finished difference Result 708 states and 1453 transitions. [2024-11-09 19:19:42,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:19:42,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2024-11-09 19:19:42,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:19:42,806 INFO L225 Difference]: With dead ends: 708 [2024-11-09 19:19:42,806 INFO L226 Difference]: Without dead ends: 425 [2024-11-09 19:19:42,807 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-09 19:19:42,810 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 184 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:19:42,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 37 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:19:42,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-09 19:19:42,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2024-11-09 19:19:42,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.9386792452830188) internal successors, (822), 424 states have internal predecessors, (822), 0 states have call successors, (0), 0 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-09 19:19:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 822 transitions. [2024-11-09 19:19:42,847 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 822 transitions. Word has length 112 [2024-11-09 19:19:42,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:19:42,847 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 822 transitions. [2024-11-09 19:19:42,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 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-09 19:19:42,851 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 822 transitions. [2024-11-09 19:19:42,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 19:19:42,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:19:42,859 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:19:42,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:19:42,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:19:42,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:19:42,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1386644893, now seen corresponding path program 1 times [2024-11-09 19:19:42,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:19:42,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741198748] [2024-11-09 19:19:42,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:42,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:19:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:19:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:19:43,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:19:43,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741198748] [2024-11-09 19:19:43,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741198748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:19:43,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:19:43,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:19:43,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287065437] [2024-11-09 19:19:43,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:19:43,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:19:43,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:19:43,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:19:43,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:19:43,125 INFO L87 Difference]: Start difference. First operand 425 states and 822 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 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-09 19:19:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:19:43,804 INFO L93 Difference]: Finished difference Result 568 states and 1089 transitions. [2024-11-09 19:19:43,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:19:43,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-11-09 19:19:43,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:19:43,806 INFO L225 Difference]: With dead ends: 568 [2024-11-09 19:19:43,811 INFO L226 Difference]: Without dead ends: 565 [2024-11-09 19:19:43,812 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-09 19:19:43,815 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 218 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:19:43,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 15 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:19:43,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-09 19:19:43,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 425. [2024-11-09 19:19:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.9386792452830188) internal successors, (822), 424 states have internal predecessors, (822), 0 states have call successors, (0), 0 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-09 19:19:43,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 822 transitions. [2024-11-09 19:19:43,846 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 822 transitions. Word has length 118 [2024-11-09 19:19:43,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:19:43,846 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 822 transitions. [2024-11-09 19:19:43,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 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-09 19:19:43,847 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 822 transitions. [2024-11-09 19:19:43,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 19:19:43,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:19:43,848 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:19:43,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:19:43,848 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:19:43,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:19:43,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1923163063, now seen corresponding path program 1 times [2024-11-09 19:19:43,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:19:43,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645548770] [2024-11-09 19:19:43,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:43,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:19:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:19:44,063 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:19:44,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:19:44,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645548770] [2024-11-09 19:19:44,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645548770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:19:44,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:19:44,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:19:44,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263244040] [2024-11-09 19:19:44,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:19:44,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:19:44,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:19:44,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:19:44,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:19:44,065 INFO L87 Difference]: Start difference. First operand 425 states and 822 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-09 19:19:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:19:44,642 INFO L93 Difference]: Finished difference Result 1271 states and 2462 transitions. [2024-11-09 19:19:44,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:19:44,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-11-09 19:19:44,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:19:44,646 INFO L225 Difference]: With dead ends: 1271 [2024-11-09 19:19:44,647 INFO L226 Difference]: Without dead ends: 848 [2024-11-09 19:19:44,648 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-09 19:19:44,648 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 141 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:19:44,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 37 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:19:44,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2024-11-09 19:19:44,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 845. [2024-11-09 19:19:44,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 1.8957345971563981) internal successors, (1600), 844 states have internal predecessors, (1600), 0 states have call successors, (0), 0 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-09 19:19:44,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1600 transitions. [2024-11-09 19:19:44,667 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1600 transitions. Word has length 121 [2024-11-09 19:19:44,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:19:44,668 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1600 transitions. [2024-11-09 19:19:44,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-09 19:19:44,668 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1600 transitions. [2024-11-09 19:19:44,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 19:19:44,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:19:44,671 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:19:44,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:19:44,674 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:19:44,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:19:44,675 INFO L85 PathProgramCache]: Analyzing trace with hash -2054880231, now seen corresponding path program 1 times [2024-11-09 19:19:44,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:19:44,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296628499] [2024-11-09 19:19:44,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:44,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:19:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:19:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:19:44,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:19:44,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296628499] [2024-11-09 19:19:44,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296628499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:19:44,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:19:44,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:19:44,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405927104] [2024-11-09 19:19:44,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:19:44,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:19:44,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:19:44,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:19:44,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:19:44,831 INFO L87 Difference]: Start difference. First operand 845 states and 1600 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 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-09 19:19:45,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:19:45,297 INFO L93 Difference]: Finished difference Result 2388 states and 4529 transitions. [2024-11-09 19:19:45,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:19:45,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2024-11-09 19:19:45,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:19:45,302 INFO L225 Difference]: With dead ends: 2388 [2024-11-09 19:19:45,302 INFO L226 Difference]: Without dead ends: 1545 [2024-11-09 19:19:45,303 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-09 19:19:45,304 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 125 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:19:45,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 71 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 19:19:45,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-11-09 19:19:45,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1265. [2024-11-09 19:19:45,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.8132911392405062) internal successors, (2292), 1264 states have internal predecessors, (2292), 0 states have call successors, (0), 0 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-09 19:19:45,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 2292 transitions. [2024-11-09 19:19:45,340 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 2292 transitions. Word has length 137 [2024-11-09 19:19:45,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:19:45,341 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 2292 transitions. [2024-11-09 19:19:45,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 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-09 19:19:45,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 2292 transitions. [2024-11-09 19:19:45,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-09 19:19:45,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:19:45,346 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:19:45,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:19:45,346 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:19:45,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:19:45,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1248058795, now seen corresponding path program 1 times [2024-11-09 19:19:45,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:19:45,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397044594] [2024-11-09 19:19:45,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:45,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:19:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:19:45,805 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:19:45,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:19:45,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397044594] [2024-11-09 19:19:45,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397044594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:19:45,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:19:45,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 19:19:45,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173414077] [2024-11-09 19:19:45,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:19:45,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 19:19:45,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:19:45,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 19:19:45,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:19:45,807 INFO L87 Difference]: Start difference. First operand 1265 states and 2292 transitions. Second operand has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 6 states have internal predecessors, (197), 0 states have call successors, (0), 0 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-09 19:19:46,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:19:46,322 INFO L93 Difference]: Finished difference Result 2584 states and 4638 transitions. [2024-11-09 19:19:46,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 19:19:46,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 6 states have internal predecessors, (197), 0 states have call successors, (0), 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 197 [2024-11-09 19:19:46,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:19:46,326 INFO L225 Difference]: With dead ends: 2584 [2024-11-09 19:19:46,326 INFO L226 Difference]: Without dead ends: 1265 [2024-11-09 19:19:46,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:19:46,328 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 217 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:19:46,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 34 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:19:46,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2024-11-09 19:19:46,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1265. [2024-11-09 19:19:46,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.8061708860759493) internal successors, (2283), 1264 states have internal predecessors, (2283), 0 states have call successors, (0), 0 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-09 19:19:46,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 2283 transitions. [2024-11-09 19:19:46,344 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 2283 transitions. Word has length 197 [2024-11-09 19:19:46,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:19:46,344 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 2283 transitions. [2024-11-09 19:19:46,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 6 states have internal predecessors, (197), 0 states have call successors, (0), 0 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-09 19:19:46,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 2283 transitions. [2024-11-09 19:19:46,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-09 19:19:46,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:19:46,346 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2024-11-09 19:19:46,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:19:46,346 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:19:46,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:19:46,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2005654577, now seen corresponding path program 1 times [2024-11-09 19:19:46,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:19:46,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487565806] [2024-11-09 19:19:46,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:46,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:19:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:19:46,489 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:19:46,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:19:46,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487565806] [2024-11-09 19:19:46,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487565806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:19:46,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:19:46,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:19:46,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680425830] [2024-11-09 19:19:46,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:19:46,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:19:46,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:19:46,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:19:46,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:19:46,491 INFO L87 Difference]: Start difference. First operand 1265 states and 2283 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 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-09 19:19:46,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:19:46,936 INFO L93 Difference]: Finished difference Result 3088 states and 5598 transitions. [2024-11-09 19:19:46,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:19:46,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2024-11-09 19:19:46,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:19:46,941 INFO L225 Difference]: With dead ends: 3088 [2024-11-09 19:19:46,942 INFO L226 Difference]: Without dead ends: 1825 [2024-11-09 19:19:46,943 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-09 19:19:46,943 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 127 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:19:46,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 290 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 19:19:46,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2024-11-09 19:19:46,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1405. [2024-11-09 19:19:46,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1404 states have (on average 1.7799145299145298) internal successors, (2499), 1404 states have internal predecessors, (2499), 0 states have call successors, (0), 0 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-09 19:19:46,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 2499 transitions. [2024-11-09 19:19:46,963 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 2499 transitions. Word has length 204 [2024-11-09 19:19:46,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:19:46,963 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 2499 transitions. [2024-11-09 19:19:46,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 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-09 19:19:46,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 2499 transitions. [2024-11-09 19:19:46,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-09 19:19:46,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:19:46,965 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:19:46,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:19:46,965 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:19:46,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:19:46,966 INFO L85 PathProgramCache]: Analyzing trace with hash -794129035, now seen corresponding path program 1 times [2024-11-09 19:19:46,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:19:46,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868052880] [2024-11-09 19:19:46,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:46,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:19:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:19:47,201 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-09 19:19:47,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:19:47,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868052880] [2024-11-09 19:19:47,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868052880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:19:47,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:19:47,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:19:47,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747706527] [2024-11-09 19:19:47,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:19:47,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:19:47,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:19:47,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:19:47,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:19:47,203 INFO L87 Difference]: Start difference. First operand 1405 states and 2499 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 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-09 19:19:47,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:19:47,629 INFO L93 Difference]: Finished difference Result 2948 states and 5219 transitions. [2024-11-09 19:19:47,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:19:47,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 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 211 [2024-11-09 19:19:47,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:19:47,634 INFO L225 Difference]: With dead ends: 2948 [2024-11-09 19:19:47,634 INFO L226 Difference]: Without dead ends: 1545 [2024-11-09 19:19:47,635 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-09 19:19:47,636 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 142 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:19:47,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 86 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 19:19:47,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-11-09 19:19:47,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1545. [2024-11-09 19:19:47,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 1.7597150259067358) internal successors, (2717), 1544 states have internal predecessors, (2717), 0 states have call successors, (0), 0 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-09 19:19:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2717 transitions. [2024-11-09 19:19:47,657 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2717 transitions. Word has length 211 [2024-11-09 19:19:47,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:19:47,657 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2717 transitions. [2024-11-09 19:19:47,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 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-09 19:19:47,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2717 transitions. [2024-11-09 19:19:47,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-09 19:19:47,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:19:47,659 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-09 19:19:47,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:19:47,660 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:19:47,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:19:47,660 INFO L85 PathProgramCache]: Analyzing trace with hash -511212009, now seen corresponding path program 1 times [2024-11-09 19:19:47,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:19:47,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903581760] [2024-11-09 19:19:47,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:47,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:19:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:19:47,828 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:19:47,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:19:47,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903581760] [2024-11-09 19:19:47,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903581760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:19:47,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:19:47,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:19:47,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869690257] [2024-11-09 19:19:47,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:19:47,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:19:47,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:19:47,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:19:47,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:19:47,830 INFO L87 Difference]: Start difference. First operand 1545 states and 2717 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 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-09 19:19:48,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:19:48,299 INFO L93 Difference]: Finished difference Result 3368 states and 5994 transitions. [2024-11-09 19:19:48,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:19:48,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 233 [2024-11-09 19:19:48,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:19:48,305 INFO L225 Difference]: With dead ends: 3368 [2024-11-09 19:19:48,305 INFO L226 Difference]: Without dead ends: 1965 [2024-11-09 19:19:48,306 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-09 19:19:48,306 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 149 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:19:48,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 269 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 19:19:48,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2024-11-09 19:19:48,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1825. [2024-11-09 19:19:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1825 states, 1824 states have (on average 1.6979166666666667) internal successors, (3097), 1824 states have internal predecessors, (3097), 0 states have call successors, (0), 0 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-09 19:19:48,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 3097 transitions. [2024-11-09 19:19:48,329 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 3097 transitions. Word has length 233 [2024-11-09 19:19:48,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:19:48,330 INFO L471 AbstractCegarLoop]: Abstraction has 1825 states and 3097 transitions. [2024-11-09 19:19:48,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 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-09 19:19:48,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 3097 transitions. [2024-11-09 19:19:48,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-11-09 19:19:48,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:19:48,333 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 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-09 19:19:48,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:19:48,333 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:19:48,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:19:48,333 INFO L85 PathProgramCache]: Analyzing trace with hash 223609283, now seen corresponding path program 1 times [2024-11-09 19:19:48,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:19:48,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907724319] [2024-11-09 19:19:48,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:48,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:19:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:19:48,509 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-11-09 19:19:48,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:19:48,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907724319] [2024-11-09 19:19:48,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907724319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:19:48,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:19:48,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:19:48,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493186812] [2024-11-09 19:19:48,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:19:48,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:19:48,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:19:48,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:19:48,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:19:48,511 INFO L87 Difference]: Start difference. First operand 1825 states and 3097 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 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-09 19:19:48,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:19:48,966 INFO L93 Difference]: Finished difference Result 1968 states and 3322 transitions. [2024-11-09 19:19:48,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:19:48,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 323 [2024-11-09 19:19:48,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:19:48,972 INFO L225 Difference]: With dead ends: 1968 [2024-11-09 19:19:48,972 INFO L226 Difference]: Without dead ends: 1965 [2024-11-09 19:19:48,973 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-09 19:19:48,973 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 218 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:19:48,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 15 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 19:19:48,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2024-11-09 19:19:48,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1685. [2024-11-09 19:19:48,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1685 states, 1684 states have (on average 1.7054631828978621) internal successors, (2872), 1684 states have internal predecessors, (2872), 0 states have call successors, (0), 0 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-09 19:19:48,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 2872 transitions. [2024-11-09 19:19:48,994 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 2872 transitions. Word has length 323 [2024-11-09 19:19:48,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:19:48,995 INFO L471 AbstractCegarLoop]: Abstraction has 1685 states and 2872 transitions. [2024-11-09 19:19:48,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 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-09 19:19:48,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 2872 transitions. [2024-11-09 19:19:48,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-11-09 19:19:48,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:19:48,998 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:19:48,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:19:48,998 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:19:48,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:19:48,999 INFO L85 PathProgramCache]: Analyzing trace with hash -606373503, now seen corresponding path program 1 times [2024-11-09 19:19:48,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:19:48,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85387429] [2024-11-09 19:19:48,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:48,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:19:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:19:49,411 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2024-11-09 19:19:49,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:19:49,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85387429] [2024-11-09 19:19:49,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85387429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:19:49,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:19:49,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:19:49,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504642401] [2024-11-09 19:19:49,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:19:49,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:19:49,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:19:49,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:19:49,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:19:49,415 INFO L87 Difference]: Start difference. First operand 1685 states and 2872 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-09 19:19:50,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:19:50,076 INFO L93 Difference]: Finished difference Result 3225 states and 5522 transitions. [2024-11-09 19:19:50,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:19:50,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 344 [2024-11-09 19:19:50,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:19:50,081 INFO L225 Difference]: With dead ends: 3225 [2024-11-09 19:19:50,081 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 19:19:50,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-09 19:19:50,083 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 199 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:19:50,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 21 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:19:50,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 19:19:50,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 19:19:50,087 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-09 19:19:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 19:19:50,088 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 344 [2024-11-09 19:19:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:19:50,088 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 19:19:50,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-09 19:19:50,088 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 19:19:50,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 19:19:50,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 19:19:50,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:19:50,096 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:19:50,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 19:19:50,331 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 19:19:50,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:19:50 BoogieIcfgContainer [2024-11-09 19:19:50,351 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 19:19:50,351 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 19:19:50,351 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 19:19:50,351 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 19:19:50,352 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:19:39" (3/4) ... [2024-11-09 19:19:50,353 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 19:19:50,372 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 19:19:50,375 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 19:19:50,376 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 19:19:50,376 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 19:19:50,498 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 19:19:50,499 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 19:19:50,499 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 19:19:50,500 INFO L158 Benchmark]: Toolchain (without parser) took 12478.51ms. Allocated memory was 190.8MB in the beginning and 459.3MB in the end (delta: 268.4MB). Free memory was 116.6MB in the beginning and 372.6MB in the end (delta: -256.1MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-11-09 19:19:50,500 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 190.8MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 19:19:50,500 INFO L158 Benchmark]: CACSL2BoogieTranslator took 552.61ms. Allocated memory is still 190.8MB. Free memory was 116.3MB in the beginning and 146.9MB in the end (delta: -30.6MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-11-09 19:19:50,500 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.84ms. Allocated memory is still 190.8MB. Free memory was 146.9MB in the beginning and 139.5MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 19:19:50,501 INFO L158 Benchmark]: Boogie Preprocessor took 102.30ms. Allocated memory is still 190.8MB. Free memory was 139.5MB in the beginning and 130.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 19:19:50,501 INFO L158 Benchmark]: IcfgBuilder took 1120.63ms. Allocated memory is still 190.8MB. Free memory was 130.2MB in the beginning and 111.7MB in the end (delta: 18.5MB). Peak memory consumption was 86.5MB. Max. memory is 16.1GB. [2024-11-09 19:19:50,501 INFO L158 Benchmark]: TraceAbstraction took 10471.28ms. Allocated memory was 190.8MB in the beginning and 459.3MB in the end (delta: 268.4MB). Free memory was 111.7MB in the beginning and 387.3MB in the end (delta: -275.6MB). Peak memory consumption was 234.0MB. Max. memory is 16.1GB. [2024-11-09 19:19:50,501 INFO L158 Benchmark]: Witness Printer took 148.14ms. Allocated memory is still 459.3MB. Free memory was 387.3MB in the beginning and 372.6MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 19:19:50,502 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 190.8MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 552.61ms. Allocated memory is still 190.8MB. Free memory was 116.3MB in the beginning and 146.9MB in the end (delta: -30.6MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.84ms. Allocated memory is still 190.8MB. Free memory was 146.9MB in the beginning and 139.5MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.30ms. Allocated memory is still 190.8MB. Free memory was 139.5MB in the beginning and 130.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1120.63ms. Allocated memory is still 190.8MB. Free memory was 130.2MB in the beginning and 111.7MB in the end (delta: 18.5MB). Peak memory consumption was 86.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10471.28ms. Allocated memory was 190.8MB in the beginning and 459.3MB in the end (delta: 268.4MB). Free memory was 111.7MB in the beginning and 387.3MB in the end (delta: -275.6MB). Peak memory consumption was 234.0MB. Max. memory is 16.1GB. * Witness Printer took 148.14ms. Allocated memory is still 459.3MB. Free memory was 387.3MB in the beginning and 372.6MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. 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: 134]: 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, 209 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1942 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1942 mSDsluCounter, 955 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 81 mSDsCounter, 679 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6046 IncrementalHoareTripleChecker+Invalid, 6725 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 679 mSolverCounterUnsat, 874 mSDtfsCounter, 6046 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1825occurred in iteration=9, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1263 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2042 NumberOfCodeBlocks, 2042 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2031 ConstructedInterpolants, 0 QuantifiedInterpolants, 4712 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 1483/1483 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: 592]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 19:19:50,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE