./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/rev-3-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/rev-3-u.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 fe3cf414f0e241a9a4e73e59647cf6619ea50b905df4a1c2a404b3413992b780 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 09:16:19,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 09:16:19,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 09:16:19,888 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 09:16:19,888 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 09:16:19,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 09:16:19,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 09:16:19,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 09:16:19,912 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 09:16:19,915 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 09:16:19,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 09:16:19,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 09:16:19,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 09:16:19,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 09:16:19,916 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 09:16:19,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 09:16:19,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 09:16:19,917 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 09:16:19,917 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 09:16:19,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 09:16:19,917 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 09:16:19,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 09:16:19,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 09:16:19,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 09:16:19,920 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 09:16:19,920 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 09:16:19,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 09:16:19,920 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 09:16:19,921 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 09:16:19,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 09:16:19,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 09:16:19,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 09:16:19,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:16:19,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 09:16:19,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 09:16:19,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 09:16:19,923 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 09:16:19,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 09:16:19,923 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 09:16:19,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 09:16:19,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 09:16:19,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 09:16:19,924 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 -> fe3cf414f0e241a9a4e73e59647cf6619ea50b905df4a1c2a404b3413992b780 [2024-11-18 09:16:20,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 09:16:20,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 09:16:20,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 09:16:20,171 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 09:16:20,172 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 09:16:20,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/rev-3-u.c [2024-11-18 09:16:21,541 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 09:16:21,692 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 09:16:21,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-3-u.c [2024-11-18 09:16:21,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0780259b/8fed841cf40b47228299b475d338ee95/FLAGcc3bd14fc [2024-11-18 09:16:21,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0780259b/8fed841cf40b47228299b475d338ee95 [2024-11-18 09:16:21,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 09:16:21,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 09:16:21,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 09:16:21,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 09:16:21,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 09:16:21,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:16:21" (1/1) ... [2024-11-18 09:16:21,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@394c53ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:16:21, skipping insertion in model container [2024-11-18 09:16:21,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:16:21" (1/1) ... [2024-11-18 09:16:21,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 09:16:21,897 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-3-u.c[319,332] [2024-11-18 09:16:21,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:16:21,920 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 09:16:21,960 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-3-u.c[319,332] [2024-11-18 09:16:21,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:16:22,019 INFO L204 MainTranslator]: Completed translation [2024-11-18 09:16:22,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:16:22 WrapperNode [2024-11-18 09:16:22,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 09:16:22,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 09:16:22,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 09:16:22,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 09:16:22,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:16:22" (1/1) ... [2024-11-18 09:16:22,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:16:22" (1/1) ... [2024-11-18 09:16:22,063 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 106 [2024-11-18 09:16:22,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 09:16:22,065 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 09:16:22,065 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 09:16:22,065 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 09:16:22,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:16:22" (1/1) ... [2024-11-18 09:16:22,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:16:22" (1/1) ... [2024-11-18 09:16:22,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:16:22" (1/1) ... [2024-11-18 09:16:22,090 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-18 09:16:22,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:16:22" (1/1) ... [2024-11-18 09:16:22,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:16:22" (1/1) ... [2024-11-18 09:16:22,095 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:16:22" (1/1) ... [2024-11-18 09:16:22,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:16:22" (1/1) ... [2024-11-18 09:16:22,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:16:22" (1/1) ... [2024-11-18 09:16:22,100 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:16:22" (1/1) ... [2024-11-18 09:16:22,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 09:16:22,102 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 09:16:22,102 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 09:16:22,102 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 09:16:22,103 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:16:22" (1/1) ... [2024-11-18 09:16:22,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:16:22,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:16:22,138 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 09:16:22,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 09:16:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 09:16:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 09:16:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 09:16:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-18 09:16:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-18 09:16:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-18 09:16:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-18 09:16:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-18 09:16:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 09:16:22,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 09:16:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 09:16:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 09:16:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-18 09:16:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 09:16:22,273 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 09:16:22,275 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 09:16:22,509 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-18 09:16:22,509 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 09:16:22,527 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 09:16:22,527 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-18 09:16:22,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:16:22 BoogieIcfgContainer [2024-11-18 09:16:22,529 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 09:16:22,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 09:16:22,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 09:16:22,534 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 09:16:22,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:16:21" (1/3) ... [2024-11-18 09:16:22,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf6878f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:16:22, skipping insertion in model container [2024-11-18 09:16:22,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:16:22" (2/3) ... [2024-11-18 09:16:22,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf6878f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:16:22, skipping insertion in model container [2024-11-18 09:16:22,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:16:22" (3/3) ... [2024-11-18 09:16:22,536 INFO L112 eAbstractionObserver]: Analyzing ICFG rev-3-u.c [2024-11-18 09:16:22,551 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 09:16:22,551 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 09:16:22,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 09:16:22,600 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;@1bdb991a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 09:16:22,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 09:16:22,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.8) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:16:22,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-18 09:16:22,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:16:22,612 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:16:22,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:16:22,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:16:22,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1568356865, now seen corresponding path program 1 times [2024-11-18 09:16:22,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:16:22,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769906551] [2024-11-18 09:16:22,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:16:22,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:16:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:16:22,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:16:22,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:16:22,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769906551] [2024-11-18 09:16:22,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769906551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:16:22,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:16:22,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 09:16:22,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553984903] [2024-11-18 09:16:22,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:16:22,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 09:16:22,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:16:22,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 09:16:22,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 09:16:22,840 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.8) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:16:22,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:16:22,852 INFO L93 Difference]: Finished difference Result 52 states and 88 transitions. [2024-11-18 09:16:22,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 09:16:22,854 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-18 09:16:22,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:16:22,859 INFO L225 Difference]: With dead ends: 52 [2024-11-18 09:16:22,859 INFO L226 Difference]: Without dead ends: 23 [2024-11-18 09:16:22,862 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-11-18 09:16:22,865 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:16:22,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:16:22,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-18 09:16:22,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-18 09:16:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:16:22,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-11-18 09:16:22,888 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 11 [2024-11-18 09:16:22,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:16:22,889 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-11-18 09:16:22,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:16:22,889 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-11-18 09:16:22,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-18 09:16:22,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:16:22,890 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:16:22,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 09:16:22,890 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:16:22,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:16:22,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1115669473, now seen corresponding path program 1 times [2024-11-18 09:16:22,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:16:22,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628164134] [2024-11-18 09:16:22,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:16:22,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:16:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:16:23,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:16:23,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:16:23,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628164134] [2024-11-18 09:16:23,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628164134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:16:23,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:16:23,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:16:23,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686905519] [2024-11-18 09:16:23,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:16:23,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:16:23,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:16:23,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:16:23,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:16:23,019 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:16:23,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:16:23,076 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2024-11-18 09:16:23,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:16:23,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-18 09:16:23,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:16:23,077 INFO L225 Difference]: With dead ends: 44 [2024-11-18 09:16:23,077 INFO L226 Difference]: Without dead ends: 28 [2024-11-18 09:16:23,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:16:23,078 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:16:23,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:16:23,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-18 09:16:23,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2024-11-18 09:16:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:16:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2024-11-18 09:16:23,086 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 11 [2024-11-18 09:16:23,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:16:23,086 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2024-11-18 09:16:23,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:16:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2024-11-18 09:16:23,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-18 09:16:23,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:16:23,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:16:23,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 09:16:23,087 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:16:23,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:16:23,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1536116311, now seen corresponding path program 1 times [2024-11-18 09:16:23,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:16:23,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616751513] [2024-11-18 09:16:23,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:16:23,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:16:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:16:23,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:16:23,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:16:23,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616751513] [2024-11-18 09:16:23,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616751513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:16:23,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:16:23,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:16:23,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666039631] [2024-11-18 09:16:23,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:16:23,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:16:23,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:16:23,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:16:23,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:16:23,192 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:16:23,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:16:23,264 INFO L93 Difference]: Finished difference Result 58 states and 80 transitions. [2024-11-18 09:16:23,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:16:23,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-18 09:16:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:16:23,265 INFO L225 Difference]: With dead ends: 58 [2024-11-18 09:16:23,265 INFO L226 Difference]: Without dead ends: 37 [2024-11-18 09:16:23,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:16:23,266 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 42 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:16:23,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 22 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:16:23,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-18 09:16:23,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2024-11-18 09:16:23,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:16:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-18 09:16:23,278 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-11-18 09:16:23,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:16:23,278 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-18 09:16:23,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:16:23,279 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-18 09:16:23,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-18 09:16:23,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:16:23,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:16:23,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 09:16:23,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:16:23,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:16:23,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1209800511, now seen corresponding path program 1 times [2024-11-18 09:16:23,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:16:23,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248382822] [2024-11-18 09:16:23,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:16:23,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:16:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:16:23,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:16:23,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:16:23,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248382822] [2024-11-18 09:16:23,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248382822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:16:23,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:16:23,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:16:23,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810924117] [2024-11-18 09:16:23,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:16:23,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:16:23,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:16:23,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:16:23,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:16:23,386 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:16:23,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:16:23,442 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2024-11-18 09:16:23,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:16:23,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-18 09:16:23,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:16:23,444 INFO L225 Difference]: With dead ends: 58 [2024-11-18 09:16:23,444 INFO L226 Difference]: Without dead ends: 34 [2024-11-18 09:16:23,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:16:23,446 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:16:23,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 26 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:16:23,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-18 09:16:23,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-18 09:16:23,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:16:23,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-18 09:16:23,455 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2024-11-18 09:16:23,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:16:23,456 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-18 09:16:23,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:16:23,457 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-18 09:16:23,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-18 09:16:23,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:16:23,457 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:16:23,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 09:16:23,457 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:16:23,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:16:23,458 INFO L85 PathProgramCache]: Analyzing trace with hash -97783142, now seen corresponding path program 1 times [2024-11-18 09:16:23,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:16:23,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100561102] [2024-11-18 09:16:23,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:16:23,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:16:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:16:23,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 09:16:23,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:16:23,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100561102] [2024-11-18 09:16:23,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100561102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:16:23,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:16:23,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:16:23,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192250230] [2024-11-18 09:16:23,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:16:23,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:16:23,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:16:23,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:16:23,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:16:23,550 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:16:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:16:23,620 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2024-11-18 09:16:23,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:16:23,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-18 09:16:23,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:16:23,622 INFO L225 Difference]: With dead ends: 66 [2024-11-18 09:16:23,622 INFO L226 Difference]: Without dead ends: 54 [2024-11-18 09:16:23,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:16:23,624 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 43 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:16:23,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 20 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:16:23,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-18 09:16:23,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 31. [2024-11-18 09:16:23,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:16:23,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-11-18 09:16:23,637 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2024-11-18 09:16:23,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:16:23,640 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-18 09:16:23,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:16:23,640 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-11-18 09:16:23,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-18 09:16:23,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:16:23,641 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] [2024-11-18 09:16:23,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 09:16:23,641 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:16:23,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:16:23,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1661686170, now seen corresponding path program 1 times [2024-11-18 09:16:23,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:16:23,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240625504] [2024-11-18 09:16:23,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:16:23,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:16:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:16:23,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 09:16:23,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:16:23,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240625504] [2024-11-18 09:16:23,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240625504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:16:23,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451976136] [2024-11-18 09:16:23,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:16:23,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:16:23,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:16:23,773 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:16:23,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 09:16:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:16:23,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 09:16:23,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:16:23,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 09:16:23,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:16:23,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 09:16:23,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451976136] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:16:23,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:16:23,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-18 09:16:23,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619417530] [2024-11-18 09:16:23,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:16:23,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 09:16:23,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:16:23,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 09:16:23,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-18 09:16:23,951 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:16:24,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:16:24,052 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2024-11-18 09:16:24,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 09:16:24,053 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 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 25 [2024-11-18 09:16:24,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:16:24,053 INFO L225 Difference]: With dead ends: 80 [2024-11-18 09:16:24,053 INFO L226 Difference]: Without dead ends: 52 [2024-11-18 09:16:24,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-11-18 09:16:24,054 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 66 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:16:24,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 48 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:16:24,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-18 09:16:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2024-11-18 09:16:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:16:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2024-11-18 09:16:24,061 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 25 [2024-11-18 09:16:24,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:16:24,061 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2024-11-18 09:16:24,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:16:24,062 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2024-11-18 09:16:24,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-18 09:16:24,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:16:24,062 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:16:24,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 09:16:24,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-18 09:16:24,267 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:16:24,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:16:24,268 INFO L85 PathProgramCache]: Analyzing trace with hash 53106109, now seen corresponding path program 2 times [2024-11-18 09:16:24,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:16:24,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989114403] [2024-11-18 09:16:24,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 09:16:24,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:16:24,292 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 09:16:24,296 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:16:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-18 09:16:24,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:16:24,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989114403] [2024-11-18 09:16:24,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989114403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:16:24,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104967752] [2024-11-18 09:16:24,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 09:16:24,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:16:24,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:16:24,346 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:16:24,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 09:16:24,417 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 09:16:24,417 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:16:24,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 09:16:24,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:16:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 09:16:24,495 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:16:24,562 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 09:16:24,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104967752] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:16:24,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:16:24,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 16 [2024-11-18 09:16:24,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611315590] [2024-11-18 09:16:24,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:16:24,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-18 09:16:24,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:16:24,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-18 09:16:24,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2024-11-18 09:16:24,564 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:16:25,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:16:25,211 INFO L93 Difference]: Finished difference Result 311 states and 398 transitions. [2024-11-18 09:16:25,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-18 09:16:25,211 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 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 31 [2024-11-18 09:16:25,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:16:25,213 INFO L225 Difference]: With dead ends: 311 [2024-11-18 09:16:25,213 INFO L226 Difference]: Without dead ends: 268 [2024-11-18 09:16:25,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=629, Invalid=1093, Unknown=0, NotChecked=0, Total=1722 [2024-11-18 09:16:25,214 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 740 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 09:16:25,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 87 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 09:16:25,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-18 09:16:25,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 108. [2024-11-18 09:16:25,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.205607476635514) internal successors, (129), 107 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:16:25,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2024-11-18 09:16:25,245 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 31 [2024-11-18 09:16:25,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:16:25,245 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2024-11-18 09:16:25,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:16:25,246 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2024-11-18 09:16:25,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-18 09:16:25,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:16:25,248 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:16:25,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 09:16:25,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-18 09:16:25,449 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:16:25,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:16:25,449 INFO L85 PathProgramCache]: Analyzing trace with hash 606563801, now seen corresponding path program 3 times [2024-11-18 09:16:25,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:16:25,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597756994] [2024-11-18 09:16:25,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 09:16:25,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:16:25,670 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2024-11-18 09:16:25,670 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:16:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 126 proven. 55 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2024-11-18 09:16:26,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:16:26,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597756994] [2024-11-18 09:16:26,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597756994] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:16:26,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326290098] [2024-11-18 09:16:26,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 09:16:26,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:16:26,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:16:26,114 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:16:26,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 09:16:43,347 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2024-11-18 09:16:43,347 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:16:43,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 129 conjuncts are in the unsatisfiable core [2024-11-18 09:16:43,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:16:43,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-18 09:16:43,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-18 09:16:43,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-18 09:16:43,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-18 09:16:43,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-18 09:16:44,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-18 09:16:44,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-18 09:16:44,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-18 09:16:44,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 09:16:44,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-18 09:16:44,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 09:16:44,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-18 09:16:44,310 INFO L349 Elim1Store]: treesize reduction 33, result has 35.3 percent of original size [2024-11-18 09:16:44,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 26 [2024-11-18 09:16:44,385 INFO L349 Elim1Store]: treesize reduction 33, result has 35.3 percent of original size [2024-11-18 09:16:44,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 37 [2024-11-18 09:16:44,460 INFO L349 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2024-11-18 09:16:44,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 37 [2024-11-18 09:16:44,518 INFO L349 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2024-11-18 09:16:44,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 37 [2024-11-18 09:16:44,583 INFO L349 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2024-11-18 09:16:44,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 37 [2024-11-18 09:16:44,645 INFO L349 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2024-11-18 09:16:44,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 37 [2024-11-18 09:16:44,709 INFO L349 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2024-11-18 09:16:44,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 37 [2024-11-18 09:16:44,770 INFO L349 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2024-11-18 09:16:44,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 37 [2024-11-18 09:16:44,834 INFO L349 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2024-11-18 09:16:44,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 37 [2024-11-18 09:16:44,901 INFO L349 Elim1Store]: treesize reduction 33, result has 35.3 percent of original size [2024-11-18 09:16:44,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 37 [2024-11-18 09:16:45,300 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 1 proven. 365 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-18 09:16:45,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:17:39,370 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~k~0#1_154| Int) (|v_ULTIMATE.start_main_~j~0#1_77| Int) (|v_ULTIMATE.start_main_~k~0#1_157| Int) (|v_ULTIMATE.start_main_~k~0#1_155| Int) (v_ArrVal_268 Int) (v_ArrVal_278 Int) (v_ArrVal_265 Int) (|v_ULTIMATE.start_main_~i~0#1_37| Int) (v_ArrVal_275 Int) (v_ArrVal_285 Int) (v_ArrVal_273 Int) (v_ArrVal_283 Int) (v_ArrVal_271 Int) (v_ArrVal_270 Int) (v_ArrVal_281 Int) (v_ArrVal_280 Int)) (or (< (+ 8 |v_ULTIMATE.start_main_~k~0#1_154|) |c_ULTIMATE.start_main_~n~0#1|) (< (+ |v_ULTIMATE.start_main_~j~0#1_77| 1) |c_ULTIMATE.start_main_~n~0#1|) (let ((.cse2 (* |c_ULTIMATE.start_main_~n~0#1| 4))) (let ((.cse1 (* |c_ULTIMATE.start_main_~n~0#1| .cse2))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#B~0#1.base|) (let ((.cse0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 1)))) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (* .cse0 .cse1) (* .cse0 .cse2) (- 4) .cse2))) (select (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~k~0#1_154|)) (.cse3 (* |v_ULTIMATE.start_main_~i~0#1_37| .cse1)) (.cse4 (* |v_ULTIMATE.start_main_~j~0#1_77| .cse2))) (store (store (store (store (store (store (store (store (store (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| (* 4 |c_ULTIMATE.start_main_~k~0#1|) (* .cse1 |c_ULTIMATE.start_main_~i~0#1|) (* |c_ULTIMATE.start_main_~j~0#1| .cse2)) v_ArrVal_265) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse3 .cse4 (* 4 |v_ULTIMATE.start_main_~k~0#1_157|)) v_ArrVal_268) (+ (* 4 |v_ULTIMATE.start_main_~k~0#1_155|) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse3 .cse4) v_ArrVal_270) (+ .cse5 |c_ULTIMATE.start_main_~#A~0#1.offset| .cse3 .cse4) v_ArrVal_271) (+ .cse5 |c_ULTIMATE.start_main_~#A~0#1.offset| .cse3 .cse4 4) v_ArrVal_273) (+ .cse5 |c_ULTIMATE.start_main_~#A~0#1.offset| .cse3 .cse4 8) v_ArrVal_275) (+ .cse5 |c_ULTIMATE.start_main_~#A~0#1.offset| .cse3 .cse4 12) v_ArrVal_278) (+ .cse5 |c_ULTIMATE.start_main_~#A~0#1.offset| .cse3 16 .cse4) v_ArrVal_280) (+ .cse5 |c_ULTIMATE.start_main_~#A~0#1.offset| .cse3 .cse4 20) v_ArrVal_281) (+ .cse5 |c_ULTIMATE.start_main_~#A~0#1.offset| .cse3 .cse4 24) v_ArrVal_283) (+ .cse5 |c_ULTIMATE.start_main_~#A~0#1.offset| .cse3 .cse4 28) v_ArrVal_285)) |c_ULTIMATE.start_main_~#A~0#1.offset|)))) (< (+ |v_ULTIMATE.start_main_~k~0#1_157| 1) |v_ULTIMATE.start_main_~k~0#1_155|) (< (+ |v_ULTIMATE.start_main_~i~0#1_37| 1) |c_ULTIMATE.start_main_~n~0#1|) (< (+ |v_ULTIMATE.start_main_~k~0#1_155| 1) |v_ULTIMATE.start_main_~k~0#1_154|))) is different from false [2024-11-18 09:17:43,496 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~k~0#1_154| Int) (|v_ULTIMATE.start_main_~j~0#1_77| Int) (|v_ULTIMATE.start_main_~k~0#1_157| Int) (|v_ULTIMATE.start_main_~k~0#1_158| Int) (|v_ULTIMATE.start_main_~k~0#1_155| Int) (v_ArrVal_268 Int) (v_ArrVal_278 Int) (v_ArrVal_265 Int) (|v_ULTIMATE.start_main_~i~0#1_37| Int) (v_ArrVal_275 Int) (v_ArrVal_263 Int) (v_ArrVal_285 Int) (v_ArrVal_273 Int) (v_ArrVal_283 Int) (v_ArrVal_271 Int) (v_ArrVal_270 Int) (v_ArrVal_281 Int) (v_ArrVal_280 Int)) (or (< (+ 8 |v_ULTIMATE.start_main_~k~0#1_154|) |c_ULTIMATE.start_main_~n~0#1|) (let ((.cse2 (* |c_ULTIMATE.start_main_~n~0#1| 4))) (let ((.cse1 (* |c_ULTIMATE.start_main_~n~0#1| .cse2))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#B~0#1.base|) (let ((.cse0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 1)))) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (* .cse0 .cse1) (* .cse0 .cse2) (- 4) .cse2))) (select (let ((.cse7 (* 4 |v_ULTIMATE.start_main_~k~0#1_154|)) (.cse5 (* |v_ULTIMATE.start_main_~i~0#1_37| .cse1)) (.cse6 (* |v_ULTIMATE.start_main_~j~0#1_77| .cse2))) (store (store (store (store (store (store (store (store (store (store (let ((.cse3 (* .cse1 |c_ULTIMATE.start_main_~i~0#1|)) (.cse4 (* |c_ULTIMATE.start_main_~j~0#1| .cse2))) (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| (* 4 |c_ULTIMATE.start_main_~k~0#1|) .cse3 .cse4) v_ArrVal_263) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| (* 4 |v_ULTIMATE.start_main_~k~0#1_158|) .cse3 .cse4) v_ArrVal_265)) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse5 .cse6 (* 4 |v_ULTIMATE.start_main_~k~0#1_157|)) v_ArrVal_268) (+ (* 4 |v_ULTIMATE.start_main_~k~0#1_155|) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse5 .cse6) v_ArrVal_270) (+ .cse7 |c_ULTIMATE.start_main_~#A~0#1.offset| .cse5 .cse6) v_ArrVal_271) (+ .cse7 |c_ULTIMATE.start_main_~#A~0#1.offset| .cse5 .cse6 4) v_ArrVal_273) (+ .cse7 |c_ULTIMATE.start_main_~#A~0#1.offset| .cse5 .cse6 8) v_ArrVal_275) (+ .cse7 |c_ULTIMATE.start_main_~#A~0#1.offset| .cse5 .cse6 12) v_ArrVal_278) (+ .cse7 |c_ULTIMATE.start_main_~#A~0#1.offset| .cse5 16 .cse6) v_ArrVal_280) (+ .cse7 |c_ULTIMATE.start_main_~#A~0#1.offset| .cse5 .cse6 20) v_ArrVal_281) (+ .cse7 |c_ULTIMATE.start_main_~#A~0#1.offset| .cse5 .cse6 24) v_ArrVal_283) (+ .cse7 |c_ULTIMATE.start_main_~#A~0#1.offset| .cse5 .cse6 28) v_ArrVal_285)) |c_ULTIMATE.start_main_~#A~0#1.offset|)))) (< (+ |v_ULTIMATE.start_main_~j~0#1_77| 1) |c_ULTIMATE.start_main_~n~0#1|) (< (+ |v_ULTIMATE.start_main_~k~0#1_157| 1) |v_ULTIMATE.start_main_~k~0#1_155|) (< |v_ULTIMATE.start_main_~k~0#1_158| (+ |c_ULTIMATE.start_main_~k~0#1| 1)) (< (+ |v_ULTIMATE.start_main_~i~0#1_37| 1) |c_ULTIMATE.start_main_~n~0#1|) (< (+ |v_ULTIMATE.start_main_~k~0#1_155| 1) |v_ULTIMATE.start_main_~k~0#1_154|))) is different from false