./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_6.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/locks/test_locks_6.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 c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:33:37,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:33:38,034 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 18:33:38,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:33:38,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:33:38,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:33:38,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:33:38,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:33:38,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:33:38,066 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:33:38,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:33:38,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:33:38,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:33:38,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:33:38,067 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:33:38,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:33:38,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:33:38,072 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:33:38,072 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 18:33:38,073 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:33:38,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:33:38,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:33:38,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:33:38,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:33:38,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:33:38,077 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:33:38,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:33:38,077 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:33:38,078 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:33:38,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:33:38,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:33:38,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:33:38,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:33:38,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:33:38,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:33:38,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:33:38,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 18:33:38,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 18:33:38,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:33:38,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:33:38,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:33:38,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:33:38,081 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 -> c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 [2024-11-09 18:33:38,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:33:38,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:33:38,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:33:38,323 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:33:38,323 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:33:38,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_6.c [2024-11-09 18:33:39,580 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:33:39,769 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:33:39,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c [2024-11-09 18:33:39,781 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4c61bcf6/e953805256bf478bb973e4295ce5aafa/FLAGea4c94156 [2024-11-09 18:33:39,802 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4c61bcf6/e953805256bf478bb973e4295ce5aafa [2024-11-09 18:33:39,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:33:39,806 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:33:39,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:33:39,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:33:39,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:33:39,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:33:39" (1/1) ... [2024-11-09 18:33:39,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f669ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:39, skipping insertion in model container [2024-11-09 18:33:39,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:33:39" (1/1) ... [2024-11-09 18:33:39,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:33:40,022 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/locks/test_locks_6.c[2544,2557] [2024-11-09 18:33:40,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:33:40,042 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:33:40,058 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/locks/test_locks_6.c[2544,2557] [2024-11-09 18:33:40,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:33:40,071 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:33:40,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:40 WrapperNode [2024-11-09 18:33:40,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:33:40,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:33:40,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:33:40,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:33:40,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:40" (1/1) ... [2024-11-09 18:33:40,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:40" (1/1) ... [2024-11-09 18:33:40,107 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 99 [2024-11-09 18:33:40,108 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:33:40,113 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:33:40,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:33:40,114 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:33:40,126 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:40" (1/1) ... [2024-11-09 18:33:40,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:40" (1/1) ... [2024-11-09 18:33:40,127 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:40" (1/1) ... [2024-11-09 18:33:40,135 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 18:33:40,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:40" (1/1) ... [2024-11-09 18:33:40,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:40" (1/1) ... [2024-11-09 18:33:40,137 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:40" (1/1) ... [2024-11-09 18:33:40,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:40" (1/1) ... [2024-11-09 18:33:40,138 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:40" (1/1) ... [2024-11-09 18:33:40,139 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:40" (1/1) ... [2024-11-09 18:33:40,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:33:40,141 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:33:40,141 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:33:40,141 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:33:40,142 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:40" (1/1) ... [2024-11-09 18:33:40,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:33:40,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:33:40,170 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 18:33:40,173 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 18:33:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:33:40,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:33:40,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:33:40,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 18:33:40,261 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:33:40,264 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:33:40,447 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-09 18:33:40,450 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:33:40,464 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:33:40,464 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 18:33:40,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:33:40 BoogieIcfgContainer [2024-11-09 18:33:40,465 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:33:40,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:33:40,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:33:40,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:33:40,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:33:39" (1/3) ... [2024-11-09 18:33:40,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1cf5ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:33:40, skipping insertion in model container [2024-11-09 18:33:40,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:40" (2/3) ... [2024-11-09 18:33:40,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1cf5ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:33:40, skipping insertion in model container [2024-11-09 18:33:40,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:33:40" (3/3) ... [2024-11-09 18:33:40,481 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2024-11-09 18:33:40,498 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:33:40,498 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:33:40,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:33:40,587 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;@33505aa9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:33:40,587 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:33:40,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 18:33:40,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 18:33:40,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:40,608 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:40,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:40,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:40,618 INFO L85 PathProgramCache]: Analyzing trace with hash -46515367, now seen corresponding path program 1 times [2024-11-09 18:33:40,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:40,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106082133] [2024-11-09 18:33:40,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:40,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:40,997 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 18:33:40,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:40,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106082133] [2024-11-09 18:33:40,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106082133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:41,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:41,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:41,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005682387] [2024-11-09 18:33:41,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:41,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:41,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:41,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:41,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:41,055 INFO L87 Difference]: Start difference. First operand has 31 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 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 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 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 18:33:41,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:41,126 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2024-11-09 18:33:41,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:41,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-11-09 18:33:41,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:41,143 INFO L225 Difference]: With dead ends: 63 [2024-11-09 18:33:41,146 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 18:33:41,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:41,155 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 32 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:41,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 95 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:41,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 18:33:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2024-11-09 18:33:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.75) internal successors, (56), 32 states have internal predecessors, (56), 0 states have call successors, (0), 0 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 18:33:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 56 transitions. [2024-11-09 18:33:41,218 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 56 transitions. Word has length 15 [2024-11-09 18:33:41,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:41,219 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 56 transitions. [2024-11-09 18:33:41,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 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 18:33:41,223 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 56 transitions. [2024-11-09 18:33:41,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 18:33:41,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:41,224 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:41,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 18:33:41,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:41,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:41,225 INFO L85 PathProgramCache]: Analyzing trace with hash -243028872, now seen corresponding path program 1 times [2024-11-09 18:33:41,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:41,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662070021] [2024-11-09 18:33:41,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:41,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:41,371 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 18:33:41,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:41,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662070021] [2024-11-09 18:33:41,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662070021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:41,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:41,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:41,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857419399] [2024-11-09 18:33:41,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:41,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:41,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:41,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:41,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:41,374 INFO L87 Difference]: Start difference. First operand 33 states and 56 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 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 18:33:41,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:41,423 INFO L93 Difference]: Finished difference Result 80 states and 135 transitions. [2024-11-09 18:33:41,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:41,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-11-09 18:33:41,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:41,425 INFO L225 Difference]: With dead ends: 80 [2024-11-09 18:33:41,425 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 18:33:41,425 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 18:33:41,426 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 30 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:41,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 92 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:41,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 18:33:41,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2024-11-09 18:33:41,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.711111111111111) internal successors, (77), 45 states have internal predecessors, (77), 0 states have call successors, (0), 0 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 18:33:41,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2024-11-09 18:33:41,432 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 15 [2024-11-09 18:33:41,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:41,432 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2024-11-09 18:33:41,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 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 18:33:41,432 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2024-11-09 18:33:41,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 18:33:41,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:41,433 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:41,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 18:33:41,433 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:41,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:41,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1441140272, now seen corresponding path program 1 times [2024-11-09 18:33:41,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:41,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011499989] [2024-11-09 18:33:41,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:41,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:41,465 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 18:33:41,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:41,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011499989] [2024-11-09 18:33:41,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011499989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:41,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:41,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:41,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949772619] [2024-11-09 18:33:41,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:41,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:41,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:41,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:41,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:41,467 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 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 18:33:41,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:41,479 INFO L93 Difference]: Finished difference Result 76 states and 121 transitions. [2024-11-09 18:33:41,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:41,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-09 18:33:41,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:41,483 INFO L225 Difference]: With dead ends: 76 [2024-11-09 18:33:41,483 INFO L226 Difference]: Without dead ends: 53 [2024-11-09 18:33:41,484 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 18:33:41,485 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 32 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:41,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 102 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:41,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-09 18:33:41,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2024-11-09 18:33:41,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 49 states have internal predecessors, (80), 0 states have call successors, (0), 0 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 18:33:41,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2024-11-09 18:33:41,493 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 16 [2024-11-09 18:33:41,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:41,493 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 80 transitions. [2024-11-09 18:33:41,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 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 18:33:41,493 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 80 transitions. [2024-11-09 18:33:41,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 18:33:41,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:41,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:41,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 18:33:41,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:41,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:41,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1056875665, now seen corresponding path program 1 times [2024-11-09 18:33:41,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:41,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637581854] [2024-11-09 18:33:41,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:41,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:41,532 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 18:33:41,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:41,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637581854] [2024-11-09 18:33:41,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637581854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:41,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:41,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:41,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724052371] [2024-11-09 18:33:41,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:41,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:41,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:41,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:41,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:41,535 INFO L87 Difference]: Start difference. First operand 50 states and 80 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 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 18:33:41,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:41,555 INFO L93 Difference]: Finished difference Result 93 states and 149 transitions. [2024-11-09 18:33:41,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:41,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-09 18:33:41,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:41,557 INFO L225 Difference]: With dead ends: 93 [2024-11-09 18:33:41,557 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 18:33:41,557 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 18:33:41,558 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 27 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:41,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 83 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:41,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 18:33:41,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 65. [2024-11-09 18:33:41,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.640625) internal successors, (105), 64 states have internal predecessors, (105), 0 states have call successors, (0), 0 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 18:33:41,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 105 transitions. [2024-11-09 18:33:41,571 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 105 transitions. Word has length 16 [2024-11-09 18:33:41,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:41,571 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 105 transitions. [2024-11-09 18:33:41,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 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 18:33:41,571 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 105 transitions. [2024-11-09 18:33:41,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 18:33:41,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:41,572 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:41,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 18:33:41,572 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:41,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:41,573 INFO L85 PathProgramCache]: Analyzing trace with hash 860362160, now seen corresponding path program 1 times [2024-11-09 18:33:41,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:41,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414446898] [2024-11-09 18:33:41,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:41,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:41,617 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 18:33:41,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:41,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414446898] [2024-11-09 18:33:41,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414446898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:41,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:41,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:41,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546856749] [2024-11-09 18:33:41,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:41,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:41,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:41,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:41,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:41,621 INFO L87 Difference]: Start difference. First operand 65 states and 105 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 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 18:33:41,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:41,638 INFO L93 Difference]: Finished difference Result 151 states and 245 transitions. [2024-11-09 18:33:41,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:41,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-11-09 18:33:41,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:41,639 INFO L225 Difference]: With dead ends: 151 [2024-11-09 18:33:41,639 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 18:33:41,639 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 18:33:41,640 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 29 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:41,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 93 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:41,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 18:33:41,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2024-11-09 18:33:41,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.6022727272727273) internal successors, (141), 88 states have internal predecessors, (141), 0 states have call successors, (0), 0 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 18:33:41,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 141 transitions. [2024-11-09 18:33:41,651 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 141 transitions. Word has length 16 [2024-11-09 18:33:41,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:41,652 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 141 transitions. [2024-11-09 18:33:41,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 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 18:33:41,653 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 141 transitions. [2024-11-09 18:33:41,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 18:33:41,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:41,653 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:41,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 18:33:41,654 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:41,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:41,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1595763375, now seen corresponding path program 1 times [2024-11-09 18:33:41,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:41,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749672590] [2024-11-09 18:33:41,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:41,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:41,695 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 18:33:41,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:41,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749672590] [2024-11-09 18:33:41,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749672590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:41,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:41,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:41,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005225494] [2024-11-09 18:33:41,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:41,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:41,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:41,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:41,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:41,696 INFO L87 Difference]: Start difference. First operand 89 states and 141 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 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 18:33:41,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:41,708 INFO L93 Difference]: Finished difference Result 136 states and 212 transitions. [2024-11-09 18:33:41,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:41,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-11-09 18:33:41,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:41,709 INFO L225 Difference]: With dead ends: 136 [2024-11-09 18:33:41,709 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 18:33:41,709 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 18:33:41,710 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 31 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:41,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 98 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:41,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 18:33:41,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2024-11-09 18:33:41,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.5666666666666667) internal successors, (141), 90 states have internal predecessors, (141), 0 states have call successors, (0), 0 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 18:33:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 141 transitions. [2024-11-09 18:33:41,715 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 141 transitions. Word has length 17 [2024-11-09 18:33:41,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:41,715 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 141 transitions. [2024-11-09 18:33:41,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 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 18:33:41,715 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 141 transitions. [2024-11-09 18:33:41,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 18:33:41,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:41,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:41,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 18:33:41,716 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:41,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:41,717 INFO L85 PathProgramCache]: Analyzing trace with hash 902252562, now seen corresponding path program 1 times [2024-11-09 18:33:41,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:41,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045253659] [2024-11-09 18:33:41,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:41,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:41,734 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 18:33:41,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:41,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045253659] [2024-11-09 18:33:41,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045253659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:41,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:41,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:41,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069221698] [2024-11-09 18:33:41,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:41,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:41,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:41,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:41,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:41,737 INFO L87 Difference]: Start difference. First operand 91 states and 141 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 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 18:33:41,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:41,749 INFO L93 Difference]: Finished difference Result 165 states and 257 transitions. [2024-11-09 18:33:41,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:41,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-11-09 18:33:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:41,750 INFO L225 Difference]: With dead ends: 165 [2024-11-09 18:33:41,750 INFO L226 Difference]: Without dead ends: 162 [2024-11-09 18:33:41,751 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 18:33:41,751 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 24 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:41,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 81 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:41,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-09 18:33:41,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 123. [2024-11-09 18:33:41,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.5491803278688525) internal successors, (189), 122 states have internal predecessors, (189), 0 states have call successors, (0), 0 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 18:33:41,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 189 transitions. [2024-11-09 18:33:41,758 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 189 transitions. Word has length 17 [2024-11-09 18:33:41,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:41,758 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 189 transitions. [2024-11-09 18:33:41,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 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 18:33:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 189 transitions. [2024-11-09 18:33:41,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 18:33:41,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:41,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:41,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 18:33:41,759 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:41,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:41,760 INFO L85 PathProgramCache]: Analyzing trace with hash 705739057, now seen corresponding path program 1 times [2024-11-09 18:33:41,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:41,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468698137] [2024-11-09 18:33:41,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:41,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:41,775 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 18:33:41,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:41,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468698137] [2024-11-09 18:33:41,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468698137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:41,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:41,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:41,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611171755] [2024-11-09 18:33:41,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:41,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:41,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:41,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:41,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:41,777 INFO L87 Difference]: Start difference. First operand 123 states and 189 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 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 18:33:41,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:41,786 INFO L93 Difference]: Finished difference Result 285 states and 437 transitions. [2024-11-09 18:33:41,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:41,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-11-09 18:33:41,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:41,788 INFO L225 Difference]: With dead ends: 285 [2024-11-09 18:33:41,788 INFO L226 Difference]: Without dead ends: 170 [2024-11-09 18:33:41,788 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 18:33:41,789 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 28 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:41,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 94 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:41,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-09 18:33:41,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2024-11-09 18:33:41,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.5) internal successors, (249), 166 states have internal predecessors, (249), 0 states have call successors, (0), 0 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 18:33:41,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 249 transitions. [2024-11-09 18:33:41,802 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 249 transitions. Word has length 17 [2024-11-09 18:33:41,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:41,802 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 249 transitions. [2024-11-09 18:33:41,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 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 18:33:41,802 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 249 transitions. [2024-11-09 18:33:41,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 18:33:41,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:41,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:41,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 18:33:41,803 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:41,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:41,804 INFO L85 PathProgramCache]: Analyzing trace with hash -2094118999, now seen corresponding path program 1 times [2024-11-09 18:33:41,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:41,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105185016] [2024-11-09 18:33:41,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:41,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:41,820 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 18:33:41,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:41,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105185016] [2024-11-09 18:33:41,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105185016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:41,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:41,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:41,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063794621] [2024-11-09 18:33:41,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:41,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:41,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:41,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:41,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:41,822 INFO L87 Difference]: Start difference. First operand 167 states and 249 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 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 18:33:41,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:41,830 INFO L93 Difference]: Finished difference Result 253 states and 373 transitions. [2024-11-09 18:33:41,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:41,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-11-09 18:33:41,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:41,831 INFO L225 Difference]: With dead ends: 253 [2024-11-09 18:33:41,831 INFO L226 Difference]: Without dead ends: 174 [2024-11-09 18:33:41,831 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 18:33:41,832 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 30 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:41,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 94 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:41,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-09 18:33:41,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2024-11-09 18:33:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.464705882352941) internal successors, (249), 170 states have internal predecessors, (249), 0 states have call successors, (0), 0 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 18:33:41,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 249 transitions. [2024-11-09 18:33:41,837 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 249 transitions. Word has length 18 [2024-11-09 18:33:41,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:41,838 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 249 transitions. [2024-11-09 18:33:41,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 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 18:33:41,838 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 249 transitions. [2024-11-09 18:33:41,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 18:33:41,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:41,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:41,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 18:33:41,839 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:41,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:41,839 INFO L85 PathProgramCache]: Analyzing trace with hash 403896938, now seen corresponding path program 1 times [2024-11-09 18:33:41,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:41,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703918392] [2024-11-09 18:33:41,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:41,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:41,855 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 18:33:41,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:41,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703918392] [2024-11-09 18:33:41,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703918392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:41,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:41,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:41,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608613972] [2024-11-09 18:33:41,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:41,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:41,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:41,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:41,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:41,856 INFO L87 Difference]: Start difference. First operand 171 states and 249 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 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 18:33:41,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:41,867 INFO L93 Difference]: Finished difference Result 301 states and 441 transitions. [2024-11-09 18:33:41,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:41,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-11-09 18:33:41,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:41,868 INFO L225 Difference]: With dead ends: 301 [2024-11-09 18:33:41,868 INFO L226 Difference]: Without dead ends: 298 [2024-11-09 18:33:41,868 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 18:33:41,869 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 21 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:41,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 79 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:41,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-09 18:33:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 239. [2024-11-09 18:33:41,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 1.4327731092436975) internal successors, (341), 238 states have internal predecessors, (341), 0 states have call successors, (0), 0 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 18:33:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 341 transitions. [2024-11-09 18:33:41,875 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 341 transitions. Word has length 18 [2024-11-09 18:33:41,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:41,876 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 341 transitions. [2024-11-09 18:33:41,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 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 18:33:41,876 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 341 transitions. [2024-11-09 18:33:41,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 18:33:41,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:41,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:41,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 18:33:41,877 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:41,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:41,877 INFO L85 PathProgramCache]: Analyzing trace with hash 207383433, now seen corresponding path program 1 times [2024-11-09 18:33:41,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:41,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298482926] [2024-11-09 18:33:41,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:41,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:41,891 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 18:33:41,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:41,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298482926] [2024-11-09 18:33:41,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298482926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:41,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:41,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:41,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528605598] [2024-11-09 18:33:41,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:41,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:41,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:41,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:41,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:41,893 INFO L87 Difference]: Start difference. First operand 239 states and 341 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 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 18:33:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:41,904 INFO L93 Difference]: Finished difference Result 549 states and 777 transitions. [2024-11-09 18:33:41,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:41,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-11-09 18:33:41,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:41,907 INFO L225 Difference]: With dead ends: 549 [2024-11-09 18:33:41,907 INFO L226 Difference]: Without dead ends: 322 [2024-11-09 18:33:41,907 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 18:33:41,910 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 27 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:41,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 95 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:41,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-09 18:33:41,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 319. [2024-11-09 18:33:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.3742138364779874) internal successors, (437), 318 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:41,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 437 transitions. [2024-11-09 18:33:41,919 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 437 transitions. Word has length 18 [2024-11-09 18:33:41,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:41,919 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 437 transitions. [2024-11-09 18:33:41,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 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 18:33:41,919 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 437 transitions. [2024-11-09 18:33:41,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 18:33:41,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:41,923 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:41,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 18:33:41,923 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:41,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:41,924 INFO L85 PathProgramCache]: Analyzing trace with hash -363280886, now seen corresponding path program 1 times [2024-11-09 18:33:41,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:41,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508680037] [2024-11-09 18:33:41,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:41,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:41,958 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 18:33:41,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:41,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508680037] [2024-11-09 18:33:41,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508680037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:41,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:41,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:41,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602426676] [2024-11-09 18:33:41,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:41,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:41,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:41,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:41,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:41,959 INFO L87 Difference]: Start difference. First operand 319 states and 437 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 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 18:33:41,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:41,970 INFO L93 Difference]: Finished difference Result 481 states and 653 transitions. [2024-11-09 18:33:41,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:41,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-11-09 18:33:41,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:41,972 INFO L225 Difference]: With dead ends: 481 [2024-11-09 18:33:41,974 INFO L226 Difference]: Without dead ends: 330 [2024-11-09 18:33:41,974 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 18:33:41,974 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 29 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:41,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 90 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:41,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-09 18:33:41,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 327. [2024-11-09 18:33:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 1.3404907975460123) internal successors, (437), 326 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:33:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 437 transitions. [2024-11-09 18:33:41,985 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 437 transitions. Word has length 19 [2024-11-09 18:33:41,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:41,986 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 437 transitions. [2024-11-09 18:33:41,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 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 18:33:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 437 transitions. [2024-11-09 18:33:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 18:33:41,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:41,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:41,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 18:33:41,987 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:41,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:41,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2134735051, now seen corresponding path program 1 times [2024-11-09 18:33:41,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:41,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082750775] [2024-11-09 18:33:41,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:41,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:42,001 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 18:33:42,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:42,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082750775] [2024-11-09 18:33:42,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082750775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:42,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:42,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:42,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343284972] [2024-11-09 18:33:42,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:42,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:42,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:42,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:42,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:42,003 INFO L87 Difference]: Start difference. First operand 327 states and 437 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 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 18:33:42,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:42,018 INFO L93 Difference]: Finished difference Result 557 states and 745 transitions. [2024-11-09 18:33:42,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:42,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-11-09 18:33:42,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:42,021 INFO L225 Difference]: With dead ends: 557 [2024-11-09 18:33:42,021 INFO L226 Difference]: Without dead ends: 554 [2024-11-09 18:33:42,021 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 18:33:42,022 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 18 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:42,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 77 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:42,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-09 18:33:42,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 471. [2024-11-09 18:33:42,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 1.304255319148936) internal successors, (613), 470 states have internal predecessors, (613), 0 states have call successors, (0), 0 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 18:33:42,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 613 transitions. [2024-11-09 18:33:42,037 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 613 transitions. Word has length 19 [2024-11-09 18:33:42,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:42,037 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 613 transitions. [2024-11-09 18:33:42,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 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 18:33:42,038 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 613 transitions. [2024-11-09 18:33:42,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 18:33:42,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:42,039 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:42,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 18:33:42,039 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:42,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:42,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1938221546, now seen corresponding path program 1 times [2024-11-09 18:33:42,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:42,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751616905] [2024-11-09 18:33:42,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:42,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:42,057 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 18:33:42,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:42,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751616905] [2024-11-09 18:33:42,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751616905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:42,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:42,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:42,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810568966] [2024-11-09 18:33:42,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:42,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:42,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:42,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:42,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:42,059 INFO L87 Difference]: Start difference. First operand 471 states and 613 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 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 18:33:42,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:42,085 INFO L93 Difference]: Finished difference Result 1069 states and 1369 transitions. [2024-11-09 18:33:42,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:42,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-11-09 18:33:42,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:42,087 INFO L225 Difference]: With dead ends: 1069 [2024-11-09 18:33:42,087 INFO L226 Difference]: Without dead ends: 618 [2024-11-09 18:33:42,088 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 18:33:42,089 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 26 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:42,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 96 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:42,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-09 18:33:42,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 615. [2024-11-09 18:33:42,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 614 states have (on average 1.232899022801303) internal successors, (757), 614 states have internal predecessors, (757), 0 states have call successors, (0), 0 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 18:33:42,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 757 transitions. [2024-11-09 18:33:42,128 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 757 transitions. Word has length 19 [2024-11-09 18:33:42,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:42,129 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 757 transitions. [2024-11-09 18:33:42,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 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 18:33:42,129 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 757 transitions. [2024-11-09 18:33:42,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 18:33:42,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:42,130 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] [2024-11-09 18:33:42,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 18:33:42,131 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:42,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:42,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1753086338, now seen corresponding path program 1 times [2024-11-09 18:33:42,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:42,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923527042] [2024-11-09 18:33:42,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:42,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:42,144 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 18:33:42,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:42,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923527042] [2024-11-09 18:33:42,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923527042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:42,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:42,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:42,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601646367] [2024-11-09 18:33:42,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:42,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:42,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:42,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:42,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:42,146 INFO L87 Difference]: Start difference. First operand 615 states and 757 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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 18:33:42,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:42,161 INFO L93 Difference]: Finished difference Result 925 states and 1129 transitions. [2024-11-09 18:33:42,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:42,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-09 18:33:42,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:42,163 INFO L225 Difference]: With dead ends: 925 [2024-11-09 18:33:42,163 INFO L226 Difference]: Without dead ends: 634 [2024-11-09 18:33:42,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:42,163 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 28 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:42,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 86 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:42,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-09 18:33:42,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 631. [2024-11-09 18:33:42,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 630 states have (on average 1.2015873015873015) internal successors, (757), 630 states have internal predecessors, (757), 0 states have call successors, (0), 0 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 18:33:42,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 757 transitions. [2024-11-09 18:33:42,177 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 757 transitions. Word has length 20 [2024-11-09 18:33:42,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:42,177 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 757 transitions. [2024-11-09 18:33:42,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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 18:33:42,177 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 757 transitions. [2024-11-09 18:33:42,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 18:33:42,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:42,178 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] [2024-11-09 18:33:42,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 18:33:42,178 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:42,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:42,179 INFO L85 PathProgramCache]: Analyzing trace with hash -43865021, now seen corresponding path program 1 times [2024-11-09 18:33:42,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:42,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655376231] [2024-11-09 18:33:42,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:42,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:42,196 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 18:33:42,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:42,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655376231] [2024-11-09 18:33:42,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655376231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:42,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:42,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:42,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578627731] [2024-11-09 18:33:42,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:42,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:42,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:42,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:42,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:42,197 INFO L87 Difference]: Start difference. First operand 631 states and 757 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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 18:33:42,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:42,223 INFO L93 Difference]: Finished difference Result 1034 states and 1223 transitions. [2024-11-09 18:33:42,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:42,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-09 18:33:42,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:42,227 INFO L225 Difference]: With dead ends: 1034 [2024-11-09 18:33:42,227 INFO L226 Difference]: Without dead ends: 1031 [2024-11-09 18:33:42,227 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 18:33:42,227 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 13 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:42,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 73 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:42,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2024-11-09 18:33:42,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 935. [2024-11-09 18:33:42,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 934 states have (on average 1.1702355460385439) internal successors, (1093), 934 states have internal predecessors, (1093), 0 states have call successors, (0), 0 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 18:33:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1093 transitions. [2024-11-09 18:33:42,245 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1093 transitions. Word has length 20 [2024-11-09 18:33:42,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:42,245 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1093 transitions. [2024-11-09 18:33:42,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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 18:33:42,245 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1093 transitions. [2024-11-09 18:33:42,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 18:33:42,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:42,246 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] [2024-11-09 18:33:42,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 18:33:42,246 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:42,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:42,247 INFO L85 PathProgramCache]: Analyzing trace with hash -240378526, now seen corresponding path program 1 times [2024-11-09 18:33:42,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:33:42,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273123570] [2024-11-09 18:33:42,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:42,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:33:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:42,259 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 18:33:42,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:33:42,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273123570] [2024-11-09 18:33:42,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273123570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:42,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:42,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:33:42,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255745271] [2024-11-09 18:33:42,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:42,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:33:42,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:33:42,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:33:42,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:33:42,261 INFO L87 Difference]: Start difference. First operand 935 states and 1093 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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 18:33:42,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:42,287 INFO L93 Difference]: Finished difference Result 2087 states and 2373 transitions. [2024-11-09 18:33:42,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:33:42,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-09 18:33:42,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:42,287 INFO L225 Difference]: With dead ends: 2087 [2024-11-09 18:33:42,287 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 18:33:42,288 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 18:33:42,289 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 23 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:42,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 93 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:33:42,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 18:33:42,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 18:33:42,289 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 18:33:42,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 18:33:42,290 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2024-11-09 18:33:42,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:42,290 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 18:33:42,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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 18:33:42,290 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 18:33:42,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 18:33:42,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 18:33:42,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 18:33:42,294 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:33:42,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 18:33:42,303 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 18:33:42,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:33:42 BoogieIcfgContainer [2024-11-09 18:33:42,309 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 18:33:42,309 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 18:33:42,310 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 18:33:42,310 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 18:33:42,310 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:33:40" (3/4) ... [2024-11-09 18:33:42,311 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 18:33:42,317 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-09 18:33:42,317 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 18:33:42,317 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 18:33:42,317 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 18:33:42,373 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 18:33:42,373 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 18:33:42,373 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 18:33:42,374 INFO L158 Benchmark]: Toolchain (without parser) took 2568.53ms. Allocated memory is still 281.0MB. Free memory was 208.5MB in the beginning and 163.6MB in the end (delta: 44.9MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2024-11-09 18:33:42,374 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 144.7MB. Free memory is still 114.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:33:42,375 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.56ms. Allocated memory is still 281.0MB. Free memory was 208.5MB in the beginning and 195.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 18:33:42,375 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.30ms. Allocated memory is still 281.0MB. Free memory was 195.9MB in the beginning and 194.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 18:33:42,375 INFO L158 Benchmark]: Boogie Preprocessor took 27.11ms. Allocated memory is still 281.0MB. Free memory was 194.3MB in the beginning and 192.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:33:42,375 INFO L158 Benchmark]: IcfgBuilder took 323.82ms. Allocated memory is still 281.0MB. Free memory was 192.7MB in the beginning and 179.6MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 18:33:42,375 INFO L158 Benchmark]: TraceAbstraction took 1836.38ms. Allocated memory is still 281.0MB. Free memory was 178.8MB in the beginning and 168.9MB in the end (delta: 9.9MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2024-11-09 18:33:42,375 INFO L158 Benchmark]: Witness Printer took 63.78ms. Allocated memory is still 281.0MB. Free memory was 168.9MB in the beginning and 163.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 18:33:42,377 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.13ms. Allocated memory is still 144.7MB. Free memory is still 114.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.56ms. Allocated memory is still 281.0MB. Free memory was 208.5MB in the beginning and 195.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.30ms. Allocated memory is still 281.0MB. Free memory was 195.9MB in the beginning and 194.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.11ms. Allocated memory is still 281.0MB. Free memory was 194.3MB in the beginning and 192.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 323.82ms. Allocated memory is still 281.0MB. Free memory was 192.7MB in the beginning and 179.6MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1836.38ms. Allocated memory is still 281.0MB. Free memory was 178.8MB in the beginning and 168.9MB in the end (delta: 9.9MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * Witness Printer took 63.78ms. Allocated memory is still 281.0MB. Free memory was 168.9MB in the beginning and 163.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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: 107]: 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, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 448 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 448 mSDsluCounter, 1521 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 591 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 93 IncrementalHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 930 mSDtfsCounter, 93 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=935occurred in iteration=16, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 348 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 283 ConstructedInterpolants, 0 QuantifiedInterpolants, 529 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 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: 29]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 18:33:42,400 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