./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-2-n-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-2-n-u.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 bf03248da0b4b82491822f692d5527664b721dbcd28594bdb518a5eab7d5a1f3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:11:59,919 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:11:59,993 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:12:00,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:12:00,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:12:00,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:12:00,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:12:00,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:12:00,033 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:12:00,036 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:12:00,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:12:00,037 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:12:00,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:12:00,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:12:00,038 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:12:00,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:12:00,038 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:12:00,038 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:12:00,039 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:12:00,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:12:00,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:12:00,041 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:12:00,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:12:00,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:12:00,042 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:12:00,042 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:12:00,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:12:00,043 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:12:00,043 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:12:00,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:12:00,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:12:00,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:12:00,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:12:00,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:12:00,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:12:00,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:12:00,045 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:12:00,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:12:00,046 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:12:00,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:12:00,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:12:00,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:12:00,047 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-clean/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-clean/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 -> bf03248da0b4b82491822f692d5527664b721dbcd28594bdb518a5eab7d5a1f3 [2024-10-10 22:12:00,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:12:00,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:12:00,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:12:00,340 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:12:00,341 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:12:00,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-2-n-u.c [2024-10-10 22:12:01,804 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:12:01,988 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:12:01,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-2-n-u.c [2024-10-10 22:12:01,994 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/33f5d4f64/e3c08b0231ee4c0caceed2dedbd13d09/FLAG58f5bab78 [2024-10-10 22:12:02,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/33f5d4f64/e3c08b0231ee4c0caceed2dedbd13d09 [2024-10-10 22:12:02,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:12:02,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:12:02,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:12:02,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:12:02,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:12:02,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:12:02" (1/1) ... [2024-10-10 22:12:02,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35de2d99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:12:02, skipping insertion in model container [2024-10-10 22:12:02,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:12:02" (1/1) ... [2024-10-10 22:12:02,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:12:02,636 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-2-n-u.c[321,334] [2024-10-10 22:12:02,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:12:02,669 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:12:02,680 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-2-n-u.c[321,334] [2024-10-10 22:12:02,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:12:02,709 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:12:02,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:12:02 WrapperNode [2024-10-10 22:12:02,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:12:02,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:12:02,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:12:02,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:12:02,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:12:02" (1/1) ... [2024-10-10 22:12:02,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:12:02" (1/1) ... [2024-10-10 22:12:02,750 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2024-10-10 22:12:02,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:12:02,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:12:02,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:12:02,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:12:02,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:12:02" (1/1) ... [2024-10-10 22:12:02,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:12:02" (1/1) ... [2024-10-10 22:12:02,765 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:12:02" (1/1) ... [2024-10-10 22:12:02,782 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 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-10-10 22:12:02,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:12:02" (1/1) ... [2024-10-10 22:12:02,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:12:02" (1/1) ... [2024-10-10 22:12:02,791 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:12:02" (1/1) ... [2024-10-10 22:12:02,798 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:12:02" (1/1) ... [2024-10-10 22:12:02,799 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:12:02" (1/1) ... [2024-10-10 22:12:02,800 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:12:02" (1/1) ... [2024-10-10 22:12:02,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:12:02,807 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:12:02,807 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:12:02,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:12:02,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:12:02" (1/1) ... [2024-10-10 22:12:02,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:12:02,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:12:02,847 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:12:02,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:12:02,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:12:02,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:12:02,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-10 22:12:02,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-10 22:12:02,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-10 22:12:02,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-10 22:12:02,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-10 22:12:02,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-10 22:12:02,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:12:02,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:12:02,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-10 22:12:02,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-10 22:12:02,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-10 22:12:02,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-10 22:12:02,975 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:12:02,979 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:12:03,183 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-10 22:12:03,183 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:12:03,205 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:12:03,205 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-10 22:12:03,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:12:03 BoogieIcfgContainer [2024-10-10 22:12:03,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:12:03,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:12:03,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:12:03,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:12:03,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:12:02" (1/3) ... [2024-10-10 22:12:03,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28808621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:12:03, skipping insertion in model container [2024-10-10 22:12:03,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:12:02" (2/3) ... [2024-10-10 22:12:03,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28808621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:12:03, skipping insertion in model container [2024-10-10 22:12:03,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:12:03" (3/3) ... [2024-10-10 22:12:03,213 INFO L112 eAbstractionObserver]: Analyzing ICFG rev-2-n-u.c [2024-10-10 22:12:03,229 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:12:03,229 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:12:03,289 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:12:03,300 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;@48a29313, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:12:03,300 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:12:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:12:03,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-10 22:12:03,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:12:03,312 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:12:03,312 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:12:03,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:12:03,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1021079152, now seen corresponding path program 1 times [2024-10-10 22:12:03,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:12:03,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939848005] [2024-10-10 22:12:03,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:12:03,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:12:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:12:03,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:12:03,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:12:03,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939848005] [2024-10-10 22:12:03,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939848005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:12:03,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:12:03,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:12:03,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931885596] [2024-10-10 22:12:03,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:12:03,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:12:03,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:12:03,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:12:03,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:12:03,637 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:12:03,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:12:03,684 INFO L93 Difference]: Finished difference Result 38 states and 66 transitions. [2024-10-10 22:12:03,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:12:03,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-10-10 22:12:03,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:12:03,694 INFO L225 Difference]: With dead ends: 38 [2024-10-10 22:12:03,694 INFO L226 Difference]: Without dead ends: 19 [2024-10-10 22:12:03,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:12:03,702 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:12:03,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 25 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:12:03,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-10 22:12:03,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-10-10 22:12:03,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:12:03,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2024-10-10 22:12:03,734 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 9 [2024-10-10 22:12:03,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:12:03,735 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-10-10 22:12:03,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:12:03,736 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2024-10-10 22:12:03,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-10 22:12:03,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:12:03,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:12:03,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:12:03,737 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:12:03,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:12:03,739 INFO L85 PathProgramCache]: Analyzing trace with hash -109940317, now seen corresponding path program 1 times [2024-10-10 22:12:03,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:12:03,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678087860] [2024-10-10 22:12:03,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:12:03,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:12:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:12:03,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:12:03,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:12:03,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678087860] [2024-10-10 22:12:03,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678087860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:12:03,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:12:03,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:12:03,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473823352] [2024-10-10 22:12:03,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:12:03,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:12:03,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:12:03,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:12:03,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:12:03,869 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:12:03,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:12:03,917 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2024-10-10 22:12:03,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:12:03,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-10-10 22:12:03,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:12:03,919 INFO L225 Difference]: With dead ends: 39 [2024-10-10 22:12:03,919 INFO L226 Difference]: Without dead ends: 24 [2024-10-10 22:12:03,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:12:03,920 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:12:03,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 23 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:12:03,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-10 22:12:03,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2024-10-10 22:12:03,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:12:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-10-10 22:12:03,926 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2024-10-10 22:12:03,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:12:03,926 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-10-10 22:12:03,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:12:03,927 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-10-10 22:12:03,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-10 22:12:03,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:12:03,927 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:12:03,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:12:03,928 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:12:03,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:12:03,928 INFO L85 PathProgramCache]: Analyzing trace with hash 201196895, now seen corresponding path program 1 times [2024-10-10 22:12:03,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:12:03,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462713787] [2024-10-10 22:12:03,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:12:03,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:12:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:12:04,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-10 22:12:04,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:12:04,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462713787] [2024-10-10 22:12:04,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462713787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:12:04,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:12:04,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:12:04,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548754818] [2024-10-10 22:12:04,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:12:04,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:12:04,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:12:04,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:12:04,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:12:04,098 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:12:04,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:12:04,171 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2024-10-10 22:12:04,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:12:04,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-10-10 22:12:04,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:12:04,174 INFO L225 Difference]: With dead ends: 44 [2024-10-10 22:12:04,174 INFO L226 Difference]: Without dead ends: 35 [2024-10-10 22:12:04,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:12:04,176 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:12:04,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 16 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:12:04,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-10 22:12:04,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2024-10-10 22:12:04,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:12:04,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2024-10-10 22:12:04,188 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 13 [2024-10-10 22:12:04,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:12:04,189 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-10-10 22:12:04,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:12:04,189 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2024-10-10 22:12:04,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-10 22:12:04,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:12:04,191 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:12:04,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:12:04,192 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:12:04,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:12:04,192 INFO L85 PathProgramCache]: Analyzing trace with hash -399113842, now seen corresponding path program 1 times [2024-10-10 22:12:04,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:12:04,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448091115] [2024-10-10 22:12:04,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:12:04,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:12:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:12:04,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-10 22:12:04,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:12:04,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448091115] [2024-10-10 22:12:04,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448091115] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:12:04,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301586751] [2024-10-10 22:12:04,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:12:04,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:12:04,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:12:04,345 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:12:04,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:12:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:12:04,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:12:04,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:12:04,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-10 22:12:04,488 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:12:04,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-10 22:12:04,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301586751] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:12:04,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:12:04,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-10 22:12:04,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781621815] [2024-10-10 22:12:04,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:12:04,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 22:12:04,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:12:04,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 22:12:04,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:12:04,533 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:12:04,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:12:04,632 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2024-10-10 22:12:04,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:12:04,633 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 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-10-10 22:12:04,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:12:04,634 INFO L225 Difference]: With dead ends: 61 [2024-10-10 22:12:04,634 INFO L226 Difference]: Without dead ends: 42 [2024-10-10 22:12:04,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 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-10-10 22:12:04,636 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 110 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:12:04,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 36 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:12:04,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-10 22:12:04,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-10-10 22:12:04,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:12:04,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-10-10 22:12:04,648 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17 [2024-10-10 22:12:04,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:12:04,650 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-10-10 22:12:04,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:12:04,650 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-10-10 22:12:04,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-10 22:12:04,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:12:04,651 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:12:04,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 22:12:04,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:12:04,852 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:12:04,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:12:04,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1512840420, now seen corresponding path program 2 times [2024-10-10 22:12:04,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:12:04,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402349466] [2024-10-10 22:12:04,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:12:04,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:12:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:12:05,086 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-10 22:12:05,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:12:05,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402349466] [2024-10-10 22:12:05,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402349466] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:12:05,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503250390] [2024-10-10 22:12:05,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:12:05,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:12:05,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:12:05,093 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:12:05,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 22:12:05,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 22:12:05,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:12:05,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-10 22:12:05,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:12:05,306 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-10 22:12:05,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:12:05,413 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-10 22:12:05,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503250390] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:12:05,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:12:05,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2024-10-10 22:12:05,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193467037] [2024-10-10 22:12:05,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:12:05,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-10 22:12:05,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:12:05,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-10 22:12:05,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2024-10-10 22:12:05,416 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 18 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-10-10 22:12:05,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:12:05,647 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2024-10-10 22:12:05,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-10 22:12:05,648 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 18 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 23 [2024-10-10 22:12:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:12:05,649 INFO L225 Difference]: With dead ends: 118 [2024-10-10 22:12:05,649 INFO L226 Difference]: Without dead ends: 84 [2024-10-10 22:12:05,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2024-10-10 22:12:05,651 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 190 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:12:05,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 84 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:12:05,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-10 22:12:05,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 66. [2024-10-10 22:12:05,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 65 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:12:05,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2024-10-10 22:12:05,674 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 23 [2024-10-10 22:12:05,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:12:05,674 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2024-10-10 22:12:05,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 18 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-10-10 22:12:05,675 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2024-10-10 22:12:05,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-10 22:12:05,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:12:05,677 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:12:05,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 22:12:05,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:12:05,881 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:12:05,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:12:05,881 INFO L85 PathProgramCache]: Analyzing trace with hash -613040220, now seen corresponding path program 3 times [2024-10-10 22:12:05,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:12:05,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069264947] [2024-10-10 22:12:05,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:12:05,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:12:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:12:06,248 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-10 22:12:06,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:12:06,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069264947] [2024-10-10 22:12:06,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069264947] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:12:06,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733796292] [2024-10-10 22:12:06,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-10 22:12:06,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:12:06,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:12:06,251 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:12:06,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 22:12:06,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-10 22:12:06,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:12:06,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:12:06,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:12:06,471 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-10-10 22:12:06,471 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:12:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-10-10 22:12:06,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733796292] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:12:06,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:12:06,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 19 [2024-10-10 22:12:06,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418893294] [2024-10-10 22:12:06,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:12:06,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-10 22:12:06,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:12:06,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-10 22:12:06,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-10-10 22:12:06,574 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:12:07,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:12:07,988 INFO L93 Difference]: Finished difference Result 430 states and 476 transitions. [2024-10-10 22:12:07,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-10-10 22:12:07,988 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 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 35 [2024-10-10 22:12:07,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:12:07,991 INFO L225 Difference]: With dead ends: 430 [2024-10-10 22:12:07,991 INFO L226 Difference]: Without dead ends: 366 [2024-10-10 22:12:07,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1513, Invalid=3179, Unknown=0, NotChecked=0, Total=4692 [2024-10-10 22:12:07,994 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 1593 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1593 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:12:07,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1593 Valid, 51 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:12:07,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-10-10 22:12:08,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 155. [2024-10-10 22:12:08,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.1428571428571428) internal successors, (176), 154 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:12:08,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 176 transitions. [2024-10-10 22:12:08,024 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 176 transitions. Word has length 35 [2024-10-10 22:12:08,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:12:08,024 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 176 transitions. [2024-10-10 22:12:08,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:12:08,025 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 176 transitions. [2024-10-10 22:12:08,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-10 22:12:08,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:12:08,027 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:12:08,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 22:12:08,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:12:08,233 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:12:08,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:12:08,233 INFO L85 PathProgramCache]: Analyzing trace with hash -620097560, now seen corresponding path program 4 times [2024-10-10 22:12:08,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:12:08,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978266991] [2024-10-10 22:12:08,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:12:08,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:12:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:12:08,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 436 proven. 66 refuted. 0 times theorem prover too weak. 1786 trivial. 0 not checked. [2024-10-10 22:12:08,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:12:08,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978266991] [2024-10-10 22:12:08,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978266991] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:12:08,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046474519] [2024-10-10 22:12:08,970 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-10 22:12:08,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:12:08,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:12:08,973 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:12:08,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 22:12:10,844 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-10 22:12:10,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:12:10,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 177 conjuncts are in the unsatisfiable core [2024-10-10 22:12:10,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:12:10,941 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 27 treesize of output 23 [2024-10-10 22:12:10,983 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 0 case distinctions, treesize of input 43 treesize of output 27 [2024-10-10 22:12:11,055 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 0 case distinctions, treesize of input 43 treesize of output 27 [2024-10-10 22:12:11,098 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 0 case distinctions, treesize of input 43 treesize of output 27 [2024-10-10 22:12:11,134 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 0 case distinctions, treesize of input 43 treesize of output 27 [2024-10-10 22:12:11,180 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 0 case distinctions, treesize of input 43 treesize of output 27 [2024-10-10 22:12:11,224 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 0 case distinctions, treesize of input 43 treesize of output 27 [2024-10-10 22:12:11,269 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 0 case distinctions, treesize of input 43 treesize of output 27 [2024-10-10 22:12:11,316 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 0 case distinctions, treesize of input 43 treesize of output 27 [2024-10-10 22:12:11,359 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 0 case distinctions, treesize of input 43 treesize of output 27 [2024-10-10 22:12:11,407 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 0 case distinctions, treesize of input 43 treesize of output 27 [2024-10-10 22:12:11,553 INFO L349 Elim1Store]: treesize reduction 32, result has 17.9 percent of original size [2024-10-10 22:12:11,554 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 53 treesize of output 27 [2024-10-10 22:12:11,619 INFO L349 Elim1Store]: treesize reduction 32, result has 17.9 percent of original size [2024-10-10 22:12:11,619 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 53 treesize of output 27 [2024-10-10 22:12:11,707 INFO L349 Elim1Store]: treesize reduction 32, result has 17.9 percent of original size [2024-10-10 22:12:11,708 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 53 treesize of output 27 [2024-10-10 22:12:11,778 INFO L349 Elim1Store]: treesize reduction 32, result has 17.9 percent of original size [2024-10-10 22:12:11,779 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 53 treesize of output 27 [2024-10-10 22:12:11,838 INFO L349 Elim1Store]: treesize reduction 32, result has 17.9 percent of original size [2024-10-10 22:12:11,839 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 53 treesize of output 27 [2024-10-10 22:12:11,929 INFO L349 Elim1Store]: treesize reduction 32, result has 17.9 percent of original size [2024-10-10 22:12:11,930 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 53 treesize of output 27 [2024-10-10 22:12:11,999 INFO L349 Elim1Store]: treesize reduction 32, result has 17.9 percent of original size [2024-10-10 22:12:11,999 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 53 treesize of output 27 [2024-10-10 22:12:12,068 INFO L349 Elim1Store]: treesize reduction 32, result has 17.9 percent of original size [2024-10-10 22:12:12,068 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 53 treesize of output 27 [2024-10-10 22:12:12,138 INFO L349 Elim1Store]: treesize reduction 32, result has 17.9 percent of original size [2024-10-10 22:12:12,139 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 53 treesize of output 27 [2024-10-10 22:12:12,214 INFO L349 Elim1Store]: treesize reduction 32, result has 17.9 percent of original size [2024-10-10 22:12:12,215 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 53 treesize of output 27 [2024-10-10 22:12:12,285 INFO L349 Elim1Store]: treesize reduction 32, result has 17.9 percent of original size [2024-10-10 22:12:12,286 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 53 treesize of output 27 [2024-10-10 22:12:12,418 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-10 22:12:12,422 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 47 treesize of output 27 [2024-10-10 22:12:12,487 INFO L349 Elim1Store]: treesize reduction 36, result has 16.3 percent of original size [2024-10-10 22:12:12,488 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 53 treesize of output 27 [2024-10-10 22:12:12,560 INFO L349 Elim1Store]: treesize reduction 36, result has 16.3 percent of original size [2024-10-10 22:12:12,560 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 53 treesize of output 27 [2024-10-10 22:12:12,628 INFO L349 Elim1Store]: treesize reduction 36, result has 16.3 percent of original size [2024-10-10 22:12:12,628 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 53 treesize of output 27 [2024-10-10 22:12:12,737 INFO L349 Elim1Store]: treesize reduction 36, result has 16.3 percent of original size [2024-10-10 22:12:12,737 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 53 treesize of output 27 [2024-10-10 22:12:12,818 INFO L349 Elim1Store]: treesize reduction 36, result has 16.3 percent of original size [2024-10-10 22:12:12,818 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 53 treesize of output 27 [2024-10-10 22:12:12,904 INFO L349 Elim1Store]: treesize reduction 36, result has 16.3 percent of original size [2024-10-10 22:12:12,905 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 53 treesize of output 27 [2024-10-10 22:12:12,985 INFO L349 Elim1Store]: treesize reduction 36, result has 16.3 percent of original size [2024-10-10 22:12:12,986 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 53 treesize of output 27 [2024-10-10 22:12:13,065 INFO L349 Elim1Store]: treesize reduction 36, result has 16.3 percent of original size [2024-10-10 22:12:13,066 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 53 treesize of output 27 [2024-10-10 22:12:13,148 INFO L349 Elim1Store]: treesize reduction 36, result has 16.3 percent of original size [2024-10-10 22:12:13,149 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 53 treesize of output 27 [2024-10-10 22:12:13,227 INFO L349 Elim1Store]: treesize reduction 36, result has 16.3 percent of original size [2024-10-10 22:12:13,228 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 53 treesize of output 27 [2024-10-10 22:12:13,370 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-10 22:12:13,370 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 47 treesize of output 27 [2024-10-10 22:12:13,436 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 0 case distinctions, treesize of input 49 treesize of output 27 [2024-10-10 22:12:13,502 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 0 case distinctions, treesize of input 49 treesize of output 27 [2024-10-10 22:12:13,585 INFO L349 Elim1Store]: treesize reduction 30, result has 18.9 percent of original size [2024-10-10 22:12:13,585 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 49 treesize of output 27 [2024-10-10 22:12:13,674 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 0 case distinctions, treesize of input 49 treesize of output 27 [2024-10-10 22:12:13,732 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 0 case distinctions, treesize of input 49 treesize of output 27 [2024-10-10 22:12:13,811 INFO L349 Elim1Store]: treesize reduction 30, result has 18.9 percent of original size [2024-10-10 22:12:13,811 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 49 treesize of output 27 [2024-10-10 22:12:13,887 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 0 case distinctions, treesize of input 49 treesize of output 27 [2024-10-10 22:12:13,950 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 0 case distinctions, treesize of input 49 treesize of output 27 [2024-10-10 22:12:14,036 INFO L349 Elim1Store]: treesize reduction 30, result has 18.9 percent of original size [2024-10-10 22:12:14,036 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 49 treesize of output 27 [2024-10-10 22:12:14,125 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 0 case distinctions, treesize of input 49 treesize of output 27 [2024-10-10 22:12:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 100 proven. 1044 refuted. 0 times theorem prover too weak. 1144 trivial. 0 not checked. [2024-10-10 22:12:14,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:12:52,934 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_606 Int) (v_ArrVal_604 Int) (v_ArrVal_602 Int) (|v_ULTIMATE.start_main_~j~0#1_153| Int) (v_ArrVal_599 Int) (v_ArrVal_587 Int) (v_ArrVal_597 Int) (|v_ULTIMATE.start_main_~j~0#1_154| Int) (v_ArrVal_585 Int) (v_ArrVal_596 Int) (v_ArrVal_583 Int) (v_ArrVal_594 Int) (v_ArrVal_581 Int) (v_ArrVal_592 Int) (v_ArrVal_580 Int) (v_ArrVal_590 Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_154| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (let ((.cse1 (* |c_ULTIMATE.start_main_~n~0#1| 4))) (= (select (let ((.cse2 (* (+ |c_ULTIMATE.start_main_~i~0#1| 1) .cse1))) (store (store (store (store (store (store (store (store (store (store (store (let ((.cse0 (* .cse1 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_580) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_154| 4) .cse0) v_ArrVal_581) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 (* |v_ULTIMATE.start_main_~j~0#1_153| 4)) v_ArrVal_583)) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2) v_ArrVal_585) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 4) v_ArrVal_587) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 8) v_ArrVal_590) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 12) v_ArrVal_592) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 16) v_ArrVal_594) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 20) v_ArrVal_596) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 24) v_ArrVal_597) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 28) v_ArrVal_599) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 32) v_ArrVal_602) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2 36) v_ArrVal_604) (+ 40 |c_ULTIMATE.start_main_~#A~0#1.offset| .cse2) v_ArrVal_606)) |c_ULTIMATE.start_main_~#A~0#1.offset|) (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| (- 4) .cse1 (* .cse1 (+ (- 1) |c_ULTIMATE.start_main_~m~0#1|)))))) (< |v_ULTIMATE.start_main_~j~0#1_153| (+ |v_ULTIMATE.start_main_~j~0#1_154| 1)))) is different from false