./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label17.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label17.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a55417a97b6239a405a0dcf0983ee9e4456c0351375b5342395e4dcb7a46d5dd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:59:30,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:59:30,733 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:59:30,739 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:59:30,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:59:30,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:59:30,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:59:30,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:59:30,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:59:30,762 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:59:30,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:59:30,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:59:30,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:59:30,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:59:30,767 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:59:30,767 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:59:30,767 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:59:30,768 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:59:30,768 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:59:30,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:59:30,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:59:30,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:59:30,771 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:59:30,771 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:59:30,771 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:59:30,771 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:59:30,772 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:59:30,772 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:59:30,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:59:30,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:59:30,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:59:30,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:59:30,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:59:30,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:59:30,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:59:30,774 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:59:30,775 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:59:30,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:59:30,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:59:30,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:59:30,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:59:30,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:59:30,776 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a55417a97b6239a405a0dcf0983ee9e4456c0351375b5342395e4dcb7a46d5dd [2024-10-12 15:59:31,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:59:31,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:59:31,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:59:31,056 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:59:31,057 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:59:31,058 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label17.c [2024-10-12 15:59:32,514 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:59:32,811 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:59:32,812 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label17.c [2024-10-12 15:59:32,830 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/624923680/7c30b2ada16d48bbaa1c8eef729a89a4/FLAGe17abc985 [2024-10-12 15:59:33,093 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/624923680/7c30b2ada16d48bbaa1c8eef729a89a4 [2024-10-12 15:59:33,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:59:33,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:59:33,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:59:33,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:59:33,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:59:33,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:59:33" (1/1) ... [2024-10-12 15:59:33,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@240a5d2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:33, skipping insertion in model container [2024-10-12 15:59:33,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:59:33" (1/1) ... [2024-10-12 15:59:33,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:59:33,414 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label17.c[5541,5554] [2024-10-12 15:59:33,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:59:33,663 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:59:33,691 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label17.c[5541,5554] [2024-10-12 15:59:33,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:59:33,837 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:59:33,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:33 WrapperNode [2024-10-12 15:59:33,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:59:33,839 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:59:33,840 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:59:33,840 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:59:33,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:33" (1/1) ... [2024-10-12 15:59:33,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:33" (1/1) ... [2024-10-12 15:59:33,955 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-10-12 15:59:33,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:59:33,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:59:33,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:59:33,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:59:33,967 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:33" (1/1) ... [2024-10-12 15:59:33,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:33" (1/1) ... [2024-10-12 15:59:33,986 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:33" (1/1) ... [2024-10-12 15:59:34,061 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 15:59:34,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:33" (1/1) ... [2024-10-12 15:59:34,062 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:33" (1/1) ... [2024-10-12 15:59:34,109 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:33" (1/1) ... [2024-10-12 15:59:34,121 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:33" (1/1) ... [2024-10-12 15:59:34,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:33" (1/1) ... [2024-10-12 15:59:34,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:33" (1/1) ... [2024-10-12 15:59:34,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:59:34,162 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:59:34,162 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:59:34,162 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:59:34,164 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:33" (1/1) ... [2024-10-12 15:59:34,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:59:34,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:59:34,196 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-10-12 15:59:34,205 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-10-12 15:59:34,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:59:34,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:59:34,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:59:34,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:59:34,316 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:59:34,318 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:59:35,866 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-12 15:59:35,867 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:59:35,933 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:59:35,935 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:59:35,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:59:35 BoogieIcfgContainer [2024-10-12 15:59:35,936 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:59:35,938 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:59:35,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:59:35,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:59:35,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:59:33" (1/3) ... [2024-10-12 15:59:35,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7396625b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:59:35, skipping insertion in model container [2024-10-12 15:59:35,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:59:33" (2/3) ... [2024-10-12 15:59:35,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7396625b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:59:35, skipping insertion in model container [2024-10-12 15:59:35,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:59:35" (3/3) ... [2024-10-12 15:59:35,946 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label17.c [2024-10-12 15:59:35,963 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:59:35,964 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:59:36,042 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:59:36,051 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;@3bb2a8b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:59:36,052 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:59:36,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:36,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 15:59:36,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:36,067 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:36,068 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:36,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:36,074 INFO L85 PathProgramCache]: Analyzing trace with hash 144826052, now seen corresponding path program 1 times [2024-10-12 15:59:36,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:36,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510027712] [2024-10-12 15:59:36,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:36,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:36,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:59:36,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:36,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510027712] [2024-10-12 15:59:36,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510027712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:36,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:36,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:59:36,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283272895] [2024-10-12 15:59:36,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:36,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:59:36,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:36,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:59:36,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:59:36,330 INFO L87 Difference]: Start difference. First operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:36,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:36,392 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2024-10-12 15:59:36,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:59:36,398 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-10-12 15:59:36,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:36,410 INFO L225 Difference]: With dead ends: 441 [2024-10-12 15:59:36,411 INFO L226 Difference]: Without dead ends: 219 [2024-10-12 15:59:36,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:59:36,419 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:36,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:59:36,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-12 15:59:36,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-12 15:59:36,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2024-10-12 15:59:36,479 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 37 [2024-10-12 15:59:36,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:36,479 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2024-10-12 15:59:36,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:36,480 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2024-10-12 15:59:36,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 15:59:36,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:36,481 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:36,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:59:36,482 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:36,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:36,483 INFO L85 PathProgramCache]: Analyzing trace with hash -865632372, now seen corresponding path program 1 times [2024-10-12 15:59:36,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:36,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94022351] [2024-10-12 15:59:36,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:36,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:59:36,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:36,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94022351] [2024-10-12 15:59:36,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94022351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:36,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:36,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:59:36,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328863722] [2024-10-12 15:59:36,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:36,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:36,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:36,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:36,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:36,695 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:37,690 INFO L93 Difference]: Finished difference Result 630 states and 1029 transitions. [2024-10-12 15:59:37,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:37,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-10-12 15:59:37,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:37,695 INFO L225 Difference]: With dead ends: 630 [2024-10-12 15:59:37,696 INFO L226 Difference]: Without dead ends: 412 [2024-10-12 15:59:37,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:37,698 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 170 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:37,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 144 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 15:59:37,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-12 15:59:37,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 410. [2024-10-12 15:59:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.4596577017114913) internal successors, (597), 409 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:37,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 597 transitions. [2024-10-12 15:59:37,720 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 597 transitions. Word has length 37 [2024-10-12 15:59:37,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:37,720 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 597 transitions. [2024-10-12 15:59:37,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:37,721 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 597 transitions. [2024-10-12 15:59:37,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-12 15:59:37,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:37,724 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:37,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:59:37,724 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:37,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:37,725 INFO L85 PathProgramCache]: Analyzing trace with hash 908354916, now seen corresponding path program 1 times [2024-10-12 15:59:37,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:37,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473998280] [2024-10-12 15:59:37,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:37,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:59:37,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:37,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473998280] [2024-10-12 15:59:37,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473998280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:37,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:37,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:59:37,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647520389] [2024-10-12 15:59:37,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:37,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:37,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:37,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:37,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:37,937 INFO L87 Difference]: Start difference. First operand 410 states and 597 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 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-10-12 15:59:38,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:38,650 INFO L93 Difference]: Finished difference Result 1208 states and 1764 transitions. [2024-10-12 15:59:38,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:38,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 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) Word has length 105 [2024-10-12 15:59:38,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:38,654 INFO L225 Difference]: With dead ends: 1208 [2024-10-12 15:59:38,654 INFO L226 Difference]: Without dead ends: 799 [2024-10-12 15:59:38,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:38,657 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:38,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 120 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:59:38,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-10-12 15:59:38,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 786. [2024-10-12 15:59:38,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.3847133757961783) internal successors, (1087), 785 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:38,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1087 transitions. [2024-10-12 15:59:38,689 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1087 transitions. Word has length 105 [2024-10-12 15:59:38,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:38,690 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1087 transitions. [2024-10-12 15:59:38,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 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-10-12 15:59:38,690 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1087 transitions. [2024-10-12 15:59:38,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-12 15:59:38,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:38,693 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:38,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:59:38,694 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:38,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:38,694 INFO L85 PathProgramCache]: Analyzing trace with hash -289840065, now seen corresponding path program 1 times [2024-10-12 15:59:38,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:38,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633736237] [2024-10-12 15:59:38,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:38,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:59:39,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:39,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633736237] [2024-10-12 15:59:39,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633736237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:39,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:39,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:59:39,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219130360] [2024-10-12 15:59:39,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:39,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:39,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:39,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:39,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:39,092 INFO L87 Difference]: Start difference. First operand 786 states and 1087 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:39,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:39,731 INFO L93 Difference]: Finished difference Result 1941 states and 2628 transitions. [2024-10-12 15:59:39,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:39,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-10-12 15:59:39,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:39,738 INFO L225 Difference]: With dead ends: 1941 [2024-10-12 15:59:39,738 INFO L226 Difference]: Without dead ends: 1156 [2024-10-12 15:59:39,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:39,741 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:39,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 188 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:59:39,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2024-10-12 15:59:39,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1155. [2024-10-12 15:59:39,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1154 states have (on average 1.2772963604852687) internal successors, (1474), 1154 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:39,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1474 transitions. [2024-10-12 15:59:39,771 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1474 transitions. Word has length 107 [2024-10-12 15:59:39,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:39,772 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1474 transitions. [2024-10-12 15:59:39,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:39,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1474 transitions. [2024-10-12 15:59:39,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-12 15:59:39,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:39,783 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:39,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:59:39,784 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:39,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:39,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1407470040, now seen corresponding path program 1 times [2024-10-12 15:59:39,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:39,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636173411] [2024-10-12 15:59:39,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:39,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-12 15:59:40,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:40,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636173411] [2024-10-12 15:59:40,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636173411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:40,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:40,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:59:40,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634225878] [2024-10-12 15:59:40,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:40,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:40,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:40,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:40,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:40,011 INFO L87 Difference]: Start difference. First operand 1155 states and 1474 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:40,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:40,781 INFO L93 Difference]: Finished difference Result 2501 states and 3335 transitions. [2024-10-12 15:59:40,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:40,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 149 [2024-10-12 15:59:40,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:40,789 INFO L225 Difference]: With dead ends: 2501 [2024-10-12 15:59:40,789 INFO L226 Difference]: Without dead ends: 1531 [2024-10-12 15:59:40,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:40,793 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:40,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 154 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:59:40,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2024-10-12 15:59:40,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1531. [2024-10-12 15:59:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1530 states have (on average 1.261437908496732) internal successors, (1930), 1530 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1930 transitions. [2024-10-12 15:59:40,827 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1930 transitions. Word has length 149 [2024-10-12 15:59:40,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:40,828 INFO L471 AbstractCegarLoop]: Abstraction has 1531 states and 1930 transitions. [2024-10-12 15:59:40,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:40,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1930 transitions. [2024-10-12 15:59:40,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-12 15:59:40,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:40,832 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:40,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:59:40,833 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:40,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:40,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1095803709, now seen corresponding path program 1 times [2024-10-12 15:59:40,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:40,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838049156] [2024-10-12 15:59:40,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:40,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:59:41,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:41,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838049156] [2024-10-12 15:59:41,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838049156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:41,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:41,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:59:41,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455222062] [2024-10-12 15:59:41,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:41,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:41,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:41,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:41,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:41,104 INFO L87 Difference]: Start difference. First operand 1531 states and 1930 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:41,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:41,843 INFO L93 Difference]: Finished difference Result 3643 states and 4734 transitions. [2024-10-12 15:59:41,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:41,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2024-10-12 15:59:41,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:41,852 INFO L225 Difference]: With dead ends: 3643 [2024-10-12 15:59:41,853 INFO L226 Difference]: Without dead ends: 2297 [2024-10-12 15:59:41,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:41,856 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 197 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:41,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 319 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:59:41,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2024-10-12 15:59:41,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 2294. [2024-10-12 15:59:41,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2294 states, 2293 states have (on average 1.2651548190143915) internal successors, (2901), 2293 states have internal predecessors, (2901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:41,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 2901 transitions. [2024-10-12 15:59:41,900 INFO L78 Accepts]: Start accepts. Automaton has 2294 states and 2901 transitions. Word has length 164 [2024-10-12 15:59:41,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:41,901 INFO L471 AbstractCegarLoop]: Abstraction has 2294 states and 2901 transitions. [2024-10-12 15:59:41,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 2901 transitions. [2024-10-12 15:59:41,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-12 15:59:41,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:41,906 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:41,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:59:41,907 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:41,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:41,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1037981147, now seen corresponding path program 1 times [2024-10-12 15:59:41,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:41,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102747099] [2024-10-12 15:59:41,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:41,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:42,155 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-12 15:59:42,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:42,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102747099] [2024-10-12 15:59:42,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102747099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:42,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:42,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:59:42,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528429726] [2024-10-12 15:59:42,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:42,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:42,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:42,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:42,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:42,158 INFO L87 Difference]: Start difference. First operand 2294 states and 2901 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:42,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:42,940 INFO L93 Difference]: Finished difference Result 5521 states and 7083 transitions. [2024-10-12 15:59:42,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:42,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 219 [2024-10-12 15:59:42,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:42,952 INFO L225 Difference]: With dead ends: 5521 [2024-10-12 15:59:42,952 INFO L226 Difference]: Without dead ends: 3412 [2024-10-12 15:59:42,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:42,958 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 159 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:42,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 389 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:59:42,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3412 states. [2024-10-12 15:59:43,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3412 to 3215. [2024-10-12 15:59:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3215 states, 3214 states have (on average 1.2321095208462975) internal successors, (3960), 3214 states have internal predecessors, (3960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:43,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3215 states to 3215 states and 3960 transitions. [2024-10-12 15:59:43,011 INFO L78 Accepts]: Start accepts. Automaton has 3215 states and 3960 transitions. Word has length 219 [2024-10-12 15:59:43,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:43,012 INFO L471 AbstractCegarLoop]: Abstraction has 3215 states and 3960 transitions. [2024-10-12 15:59:43,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:43,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3215 states and 3960 transitions. [2024-10-12 15:59:43,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-12 15:59:43,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:43,016 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:43,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:59:43,016 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:43,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:43,017 INFO L85 PathProgramCache]: Analyzing trace with hash 850498924, now seen corresponding path program 1 times [2024-10-12 15:59:43,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:43,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738478879] [2024-10-12 15:59:43,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:43,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:43,227 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-12 15:59:43,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:43,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738478879] [2024-10-12 15:59:43,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738478879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:43,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:43,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:59:43,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181133383] [2024-10-12 15:59:43,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:43,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:43,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:43,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:43,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:43,229 INFO L87 Difference]: Start difference. First operand 3215 states and 3960 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:44,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:44,055 INFO L93 Difference]: Finished difference Result 8086 states and 10093 transitions. [2024-10-12 15:59:44,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:44,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 225 [2024-10-12 15:59:44,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:44,074 INFO L225 Difference]: With dead ends: 8086 [2024-10-12 15:59:44,074 INFO L226 Difference]: Without dead ends: 4872 [2024-10-12 15:59:44,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:44,080 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 172 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:44,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 142 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:59:44,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4872 states. [2024-10-12 15:59:44,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4872 to 4872. [2024-10-12 15:59:44,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4871 states have (on average 1.2270580989529871) internal successors, (5977), 4871 states have internal predecessors, (5977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 5977 transitions. [2024-10-12 15:59:44,187 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 5977 transitions. Word has length 225 [2024-10-12 15:59:44,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:44,188 INFO L471 AbstractCegarLoop]: Abstraction has 4872 states and 5977 transitions. [2024-10-12 15:59:44,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 5977 transitions. [2024-10-12 15:59:44,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-10-12 15:59:44,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:44,194 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:44,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 15:59:44,194 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:44,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:44,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1541220793, now seen corresponding path program 1 times [2024-10-12 15:59:44,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:44,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871032273] [2024-10-12 15:59:44,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:44,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:44,513 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-12 15:59:44,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:44,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871032273] [2024-10-12 15:59:44,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871032273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:44,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:44,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:59:44,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527049248] [2024-10-12 15:59:44,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:44,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:44,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:44,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:44,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:44,516 INFO L87 Difference]: Start difference. First operand 4872 states and 5977 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:45,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:45,321 INFO L93 Difference]: Finished difference Result 11042 states and 13688 transitions. [2024-10-12 15:59:45,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:45,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 256 [2024-10-12 15:59:45,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:45,340 INFO L225 Difference]: With dead ends: 11042 [2024-10-12 15:59:45,341 INFO L226 Difference]: Without dead ends: 6171 [2024-10-12 15:59:45,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:45,346 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 158 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:45,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 388 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:59:45,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6171 states. [2024-10-12 15:59:45,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6171 to 6161. [2024-10-12 15:59:45,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6161 states, 6160 states have (on average 1.211525974025974) internal successors, (7463), 6160 states have internal predecessors, (7463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6161 states to 6161 states and 7463 transitions. [2024-10-12 15:59:45,435 INFO L78 Accepts]: Start accepts. Automaton has 6161 states and 7463 transitions. Word has length 256 [2024-10-12 15:59:45,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:45,435 INFO L471 AbstractCegarLoop]: Abstraction has 6161 states and 7463 transitions. [2024-10-12 15:59:45,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:45,436 INFO L276 IsEmpty]: Start isEmpty. Operand 6161 states and 7463 transitions. [2024-10-12 15:59:45,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2024-10-12 15:59:45,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:45,443 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:45,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 15:59:45,444 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:45,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:45,446 INFO L85 PathProgramCache]: Analyzing trace with hash -24126128, now seen corresponding path program 1 times [2024-10-12 15:59:45,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:45,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098606987] [2024-10-12 15:59:45,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:45,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:45,675 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-10-12 15:59:45,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:45,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098606987] [2024-10-12 15:59:45,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098606987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:45,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:45,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:59:45,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069104972] [2024-10-12 15:59:45,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:45,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:45,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:45,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:45,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:45,678 INFO L87 Difference]: Start difference. First operand 6161 states and 7463 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:46,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:46,524 INFO L93 Difference]: Finished difference Result 13984 states and 17098 transitions. [2024-10-12 15:59:46,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:46,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 302 [2024-10-12 15:59:46,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:46,557 INFO L225 Difference]: With dead ends: 13984 [2024-10-12 15:59:46,558 INFO L226 Difference]: Without dead ends: 7824 [2024-10-12 15:59:46,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:46,570 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 197 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:46,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 58 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:59:46,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7824 states. [2024-10-12 15:59:46,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7824 to 7818. [2024-10-12 15:59:46,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7818 states, 7817 states have (on average 1.2196494818984265) internal successors, (9534), 7817 states have internal predecessors, (9534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:46,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7818 states to 7818 states and 9534 transitions. [2024-10-12 15:59:46,733 INFO L78 Accepts]: Start accepts. Automaton has 7818 states and 9534 transitions. Word has length 302 [2024-10-12 15:59:46,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:46,734 INFO L471 AbstractCegarLoop]: Abstraction has 7818 states and 9534 transitions. [2024-10-12 15:59:46,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:46,734 INFO L276 IsEmpty]: Start isEmpty. Operand 7818 states and 9534 transitions. [2024-10-12 15:59:46,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-10-12 15:59:46,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:46,750 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:46,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 15:59:46,751 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:46,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:46,751 INFO L85 PathProgramCache]: Analyzing trace with hash -675362467, now seen corresponding path program 1 times [2024-10-12 15:59:46,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:46,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48422316] [2024-10-12 15:59:46,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:46,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:46,972 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-12 15:59:46,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:46,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48422316] [2024-10-12 15:59:46,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48422316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:46,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:46,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:59:46,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934063123] [2024-10-12 15:59:46,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:46,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:46,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:46,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:46,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:46,975 INFO L87 Difference]: Start difference. First operand 7818 states and 9534 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:47,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:47,705 INFO L93 Difference]: Finished difference Result 15236 states and 18589 transitions. [2024-10-12 15:59:47,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:47,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 337 [2024-10-12 15:59:47,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:47,724 INFO L225 Difference]: With dead ends: 15236 [2024-10-12 15:59:47,724 INFO L226 Difference]: Without dead ends: 7419 [2024-10-12 15:59:47,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:47,732 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 120 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:47,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 148 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:59:47,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7419 states. [2024-10-12 15:59:47,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7419 to 7050. [2024-10-12 15:59:47,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7050 states, 7049 states have (on average 1.1554830472407434) internal successors, (8145), 7049 states have internal predecessors, (8145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7050 states to 7050 states and 8145 transitions. [2024-10-12 15:59:47,833 INFO L78 Accepts]: Start accepts. Automaton has 7050 states and 8145 transitions. Word has length 337 [2024-10-12 15:59:47,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:47,834 INFO L471 AbstractCegarLoop]: Abstraction has 7050 states and 8145 transitions. [2024-10-12 15:59:47,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:47,835 INFO L276 IsEmpty]: Start isEmpty. Operand 7050 states and 8145 transitions. [2024-10-12 15:59:47,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-10-12 15:59:47,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:47,847 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:47,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 15:59:47,847 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:47,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:47,848 INFO L85 PathProgramCache]: Analyzing trace with hash 885668464, now seen corresponding path program 1 times [2024-10-12 15:59:47,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:47,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959009190] [2024-10-12 15:59:47,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:47,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:48,329 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:59:48,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:48,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959009190] [2024-10-12 15:59:48,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959009190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:48,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:48,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:59:48,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160884487] [2024-10-12 15:59:48,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:48,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:59:48,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:48,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:59:48,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:59:48,333 INFO L87 Difference]: Start difference. First operand 7050 states and 8145 transitions. Second operand has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:49,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:49,508 INFO L93 Difference]: Finished difference Result 16679 states and 19251 transitions. [2024-10-12 15:59:49,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:59:49,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 0 states have call successors, (0), 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 342 [2024-10-12 15:59:49,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:49,525 INFO L225 Difference]: With dead ends: 16679 [2024-10-12 15:59:49,526 INFO L226 Difference]: Without dead ends: 9630 [2024-10-12 15:59:49,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:59:49,535 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 245 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:49,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 61 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 15:59:49,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9630 states. [2024-10-12 15:59:49,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9630 to 7781. [2024-10-12 15:59:49,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7781 states, 7780 states have (on average 1.1453727506426736) internal successors, (8911), 7780 states have internal predecessors, (8911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7781 states to 7781 states and 8911 transitions. [2024-10-12 15:59:49,648 INFO L78 Accepts]: Start accepts. Automaton has 7781 states and 8911 transitions. Word has length 342 [2024-10-12 15:59:49,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:49,649 INFO L471 AbstractCegarLoop]: Abstraction has 7781 states and 8911 transitions. [2024-10-12 15:59:49,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:49,649 INFO L276 IsEmpty]: Start isEmpty. Operand 7781 states and 8911 transitions. [2024-10-12 15:59:49,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2024-10-12 15:59:49,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:49,667 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:49,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 15:59:49,667 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:49,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:49,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1882430621, now seen corresponding path program 1 times [2024-10-12 15:59:49,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:49,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356372382] [2024-10-12 15:59:49,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:49,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:50,142 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-12 15:59:50,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:50,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356372382] [2024-10-12 15:59:50,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356372382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:50,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:50,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 15:59:50,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705991090] [2024-10-12 15:59:50,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:50,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:59:50,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:50,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:59:50,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:59:50,146 INFO L87 Difference]: Start difference. First operand 7781 states and 8911 transitions. Second operand has 4 states, 4 states have (on average 78.25) internal successors, (313), 4 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:51,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:51,161 INFO L93 Difference]: Finished difference Result 16851 states and 19275 transitions. [2024-10-12 15:59:51,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:59:51,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.25) internal successors, (313), 4 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 416 [2024-10-12 15:59:51,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:51,175 INFO L225 Difference]: With dead ends: 16851 [2024-10-12 15:59:51,176 INFO L226 Difference]: Without dead ends: 9071 [2024-10-12 15:59:51,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:59:51,184 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 246 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:51,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 60 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 15:59:51,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9071 states. [2024-10-12 15:59:51,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9071 to 7413. [2024-10-12 15:59:51,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7413 states, 7412 states have (on average 1.1453049109552078) internal successors, (8489), 7412 states have internal predecessors, (8489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7413 states to 7413 states and 8489 transitions. [2024-10-12 15:59:51,281 INFO L78 Accepts]: Start accepts. Automaton has 7413 states and 8489 transitions. Word has length 416 [2024-10-12 15:59:51,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:51,282 INFO L471 AbstractCegarLoop]: Abstraction has 7413 states and 8489 transitions. [2024-10-12 15:59:51,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.25) internal successors, (313), 4 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:51,282 INFO L276 IsEmpty]: Start isEmpty. Operand 7413 states and 8489 transitions. [2024-10-12 15:59:51,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2024-10-12 15:59:51,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:59:51,302 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:51,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 15:59:51,303 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:59:51,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:59:51,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1924707017, now seen corresponding path program 1 times [2024-10-12 15:59:51,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:59:51,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465357530] [2024-10-12 15:59:51,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:59:51,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:59:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:59:51,576 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 470 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-12 15:59:51,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:59:51,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465357530] [2024-10-12 15:59:51,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465357530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:59:51,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:59:51,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:59:51,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839089774] [2024-10-12 15:59:51,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:59:51,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:59:51,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:59:51,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:59:51,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:51,579 INFO L87 Difference]: Start difference. First operand 7413 states and 8489 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:59:52,357 INFO L93 Difference]: Finished difference Result 16110 states and 18454 transitions. [2024-10-12 15:59:52,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:59:52,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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 535 [2024-10-12 15:59:52,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:59:52,358 INFO L225 Difference]: With dead ends: 16110 [2024-10-12 15:59:52,358 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 15:59:52,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:59:52,369 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 193 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:59:52,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 352 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:59:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 15:59:52,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 15:59:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 15:59:52,370 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 535 [2024-10-12 15:59:52,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:59:52,370 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 15:59:52,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:59:52,371 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 15:59:52,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 15:59:52,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:59:52,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 15:59:52,377 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:59:52,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 15:59:52,953 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:59:52,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:59:52 BoogieIcfgContainer [2024-10-12 15:59:52,973 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:59:52,973 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:59:52,973 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:59:52,974 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:59:52,974 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:59:35" (3/4) ... [2024-10-12 15:59:52,976 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 15:59:53,007 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-12 15:59:53,008 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 15:59:53,009 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 15:59:53,015 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 15:59:53,208 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:59:53,208 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 15:59:53,209 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:59:53,209 INFO L158 Benchmark]: Toolchain (without parser) took 20112.29ms. Allocated memory was 180.4MB in the beginning and 524.3MB in the end (delta: 343.9MB). Free memory was 120.2MB in the beginning and 181.8MB in the end (delta: -61.6MB). Peak memory consumption was 282.3MB. Max. memory is 16.1GB. [2024-10-12 15:59:53,210 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 50.9MB in the beginning and 50.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:59:53,210 INFO L158 Benchmark]: CACSL2BoogieTranslator took 740.05ms. Allocated memory is still 180.4MB. Free memory was 120.2MB in the beginning and 120.1MB in the end (delta: 100.3kB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 15:59:53,210 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.65ms. Allocated memory is still 180.4MB. Free memory was 120.1MB in the beginning and 102.3MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-12 15:59:53,210 INFO L158 Benchmark]: Boogie Preprocessor took 204.61ms. Allocated memory is still 180.4MB. Free memory was 102.3MB in the beginning and 77.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-12 15:59:53,211 INFO L158 Benchmark]: RCFGBuilder took 1774.59ms. Allocated memory was 180.4MB in the beginning and 283.1MB in the end (delta: 102.8MB). Free memory was 77.2MB in the beginning and 231.1MB in the end (delta: -153.9MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2024-10-12 15:59:53,211 INFO L158 Benchmark]: TraceAbstraction took 17034.57ms. Allocated memory was 283.1MB in the beginning and 524.3MB in the end (delta: 241.2MB). Free memory was 230.0MB in the beginning and 198.6MB in the end (delta: 31.4MB). Peak memory consumption was 273.6MB. Max. memory is 16.1GB. [2024-10-12 15:59:53,212 INFO L158 Benchmark]: Witness Printer took 235.32ms. Allocated memory is still 524.3MB. Free memory was 198.6MB in the beginning and 181.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 15:59:53,213 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 50.9MB in the beginning and 50.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 740.05ms. Allocated memory is still 180.4MB. Free memory was 120.2MB in the beginning and 120.1MB in the end (delta: 100.3kB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 116.65ms. Allocated memory is still 180.4MB. Free memory was 120.1MB in the beginning and 102.3MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 204.61ms. Allocated memory is still 180.4MB. Free memory was 102.3MB in the beginning and 77.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1774.59ms. Allocated memory was 180.4MB in the beginning and 283.1MB in the end (delta: 102.8MB). Free memory was 77.2MB in the beginning and 231.1MB in the end (delta: -153.9MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. * TraceAbstraction took 17034.57ms. Allocated memory was 283.1MB in the beginning and 524.3MB in the end (delta: 241.2MB). Free memory was 230.0MB in the beginning and 198.6MB in the end (delta: 31.4MB). Peak memory consumption was 273.6MB. Max. memory is 16.1GB. * Witness Printer took 235.32ms. Allocated memory is still 524.3MB. Free memory was 198.6MB in the beginning and 181.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 130]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 221 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.4s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2226 SdHoareTripleChecker+Valid, 10.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2226 mSDsluCounter, 2878 SdHoareTripleChecker+Invalid, 8.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 289 mSDsCounter, 1472 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8210 IncrementalHoareTripleChecker+Invalid, 9682 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1472 mSolverCounterUnsat, 2589 mSDtfsCounter, 8210 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7818occurred in iteration=10, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 4108 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 3231 NumberOfCodeBlocks, 3231 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3217 ConstructedInterpolants, 0 QuantifiedInterpolants, 5669 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 2651/2651 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: (((((((((a25 == 13) && (a29 <= 599998)) && (a4 == 1)) || ((a29 <= 277) && (a4 == 0))) || (((a25 == 11) && (a29 <= 599999)) && (a4 == 1))) || ((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 <= 10)) && (a29 <= 599998))) || ((a29 <= 277) && (a4 == 1))) || (((a25 <= 10) && (a29 <= 599999)) && (a4 == 1))) || (((a4 == 0) && (a25 == 11)) && (a29 <= 599998))) RESULT: Ultimate proved your program to be correct! [2024-10-12 15:59:53,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE