./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/copy-3-n-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/copy-3-n-u.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash caaec4b6d97bde36a1fbc7dfb6c9c9f88e0ac7fb0d2e87f4054fca32d8e102e9 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:03:51,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:03:51,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:03:51,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:03:51,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:03:51,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:03:51,896 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:03:51,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:03:51,897 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:03:51,898 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:03:51,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:03:51,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:03:51,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:03:51,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:03:51,901 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:03:51,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:03:51,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:03:51,901 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:03:51,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:03:51,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:03:51,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:03:51,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:03:51,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:03:51,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:03:51,904 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:03:51,905 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:03:51,905 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:03:51,905 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:03:51,905 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:03:51,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:03:51,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:03:51,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:03:51,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:03:51,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:03:51,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:03:51,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:03:51,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:03:51,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:03:51,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:03:51,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:03:51,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:03:51,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:03:51,908 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> caaec4b6d97bde36a1fbc7dfb6c9c9f88e0ac7fb0d2e87f4054fca32d8e102e9 [2024-11-08 10:03:52,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:03:52,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:03:52,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:03:52,132 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:03:52,132 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:03:52,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/copy-3-n-u.c [2024-11-08 10:03:53,390 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:03:53,534 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:03:53,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-3-n-u.c [2024-11-08 10:03:53,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba59ef7bb/089f50f29fa146958f8b075d5cd7629c/FLAG77bf545f6 [2024-11-08 10:03:53,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba59ef7bb/089f50f29fa146958f8b075d5cd7629c [2024-11-08 10:03:53,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:03:53,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:03:53,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:03:53,562 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:03:53,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:03:53,567 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:03:53" (1/1) ... [2024-11-08 10:03:53,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4636375c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:03:53, skipping insertion in model container [2024-11-08 10:03:53,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:03:53" (1/1) ... [2024-11-08 10:03:53,586 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:03:53,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-3-n-u.c[322,335] [2024-11-08 10:03:53,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:03:53,754 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:03:53,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-3-n-u.c[322,335] [2024-11-08 10:03:53,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:03:53,786 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:03:53,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:03:53 WrapperNode [2024-11-08 10:03:53,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:03:53,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:03:53,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:03:53,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:03:53,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:03:53" (1/1) ... [2024-11-08 10:03:53,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:03:53" (1/1) ... [2024-11-08 10:03:53,814 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 108 [2024-11-08 10:03:53,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:03:53,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:03:53,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:03:53,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:03:53,823 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:03:53" (1/1) ... [2024-11-08 10:03:53,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:03:53" (1/1) ... [2024-11-08 10:03:53,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:03:53" (1/1) ... [2024-11-08 10:03:53,834 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-11-08 10:03:53,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:03:53" (1/1) ... [2024-11-08 10:03:53,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:03:53" (1/1) ... [2024-11-08 10:03:53,838 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:03:53" (1/1) ... [2024-11-08 10:03:53,841 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:03:53" (1/1) ... [2024-11-08 10:03:53,842 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:03:53" (1/1) ... [2024-11-08 10:03:53,843 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:03:53" (1/1) ... [2024-11-08 10:03:53,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:03:53,849 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:03:53,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:03:53,849 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:03:53,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:03:53" (1/1) ... [2024-11-08 10:03:53,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:03:53,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:03:53,879 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 10:03:53,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 10:03:53,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:03:53,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:03:53,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 10:03:53,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 10:03:53,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 10:03:53,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 10:03:53,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 10:03:53,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 10:03:53,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:03:53,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:03:53,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 10:03:53,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 10:03:53,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 10:03:53,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 10:03:54,061 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:03:54,063 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:03:54,213 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-08 10:03:54,214 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:03:54,223 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:03:54,223 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-08 10:03:54,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:03:54 BoogieIcfgContainer [2024-11-08 10:03:54,227 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:03:54,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:03:54,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:03:54,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:03:54,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:03:53" (1/3) ... [2024-11-08 10:03:54,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727bc78d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:03:54, skipping insertion in model container [2024-11-08 10:03:54,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:03:53" (2/3) ... [2024-11-08 10:03:54,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727bc78d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:03:54, skipping insertion in model container [2024-11-08 10:03:54,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:03:54" (3/3) ... [2024-11-08 10:03:54,234 INFO L112 eAbstractionObserver]: Analyzing ICFG copy-3-n-u.c [2024-11-08 10:03:54,246 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:03:54,246 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:03:54,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:03:54,289 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;@4fde0a13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:03:54,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:03:54,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.8) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:54,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 10:03:54,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:03:54,296 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:03:54,297 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:03:54,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:03:54,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1568356865, now seen corresponding path program 1 times [2024-11-08 10:03:54,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:03:54,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19784685] [2024-11-08 10:03:54,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:03:54,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:03:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:03:54,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:03:54,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:03:54,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19784685] [2024-11-08 10:03:54,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19784685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:03:54,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:03:54,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:03:54,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754591184] [2024-11-08 10:03:54,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:03:54,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 10:03:54,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:03:54,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 10:03:54,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 10:03:54,450 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.8) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:54,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:03:54,464 INFO L93 Difference]: Finished difference Result 52 states and 88 transitions. [2024-11-08 10:03:54,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 10:03:54,466 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-08 10:03:54,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:03:54,471 INFO L225 Difference]: With dead ends: 52 [2024-11-08 10:03:54,471 INFO L226 Difference]: Without dead ends: 23 [2024-11-08 10:03:54,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 10:03:54,476 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:03:54,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:03:54,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-08 10:03:54,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-08 10:03:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:54,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-11-08 10:03:54,504 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 11 [2024-11-08 10:03:54,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:03:54,505 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-11-08 10:03:54,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-11-08 10:03:54,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 10:03:54,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:03:54,506 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:03:54,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:03:54,506 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:03:54,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:03:54,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1115669473, now seen corresponding path program 1 times [2024-11-08 10:03:54,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:03:54,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112121866] [2024-11-08 10:03:54,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:03:54,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:03:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:03:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:03:54,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:03:54,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112121866] [2024-11-08 10:03:54,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112121866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:03:54,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:03:54,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:03:54,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536501788] [2024-11-08 10:03:54,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:03:54,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:03:54,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:03:54,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:03:54,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:03:54,631 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:54,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:03:54,666 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2024-11-08 10:03:54,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:03:54,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-08 10:03:54,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:03:54,667 INFO L225 Difference]: With dead ends: 44 [2024-11-08 10:03:54,667 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 10:03:54,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:03:54,668 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:03:54,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:03:54,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 10:03:54,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2024-11-08 10:03:54,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:54,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2024-11-08 10:03:54,674 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 11 [2024-11-08 10:03:54,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:03:54,674 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2024-11-08 10:03:54,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:54,674 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2024-11-08 10:03:54,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 10:03:54,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:03:54,676 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:03:54,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:03:54,676 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:03:54,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:03:54,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1536116311, now seen corresponding path program 1 times [2024-11-08 10:03:54,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:03:54,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076307916] [2024-11-08 10:03:54,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:03:54,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:03:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:03:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:03:54,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:03:54,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076307916] [2024-11-08 10:03:54,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076307916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:03:54,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:03:54,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:03:54,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044936931] [2024-11-08 10:03:54,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:03:54,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:03:54,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:03:54,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:03:54,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:03:54,784 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:54,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:03:54,838 INFO L93 Difference]: Finished difference Result 58 states and 80 transitions. [2024-11-08 10:03:54,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:03:54,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-08 10:03:54,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:03:54,841 INFO L225 Difference]: With dead ends: 58 [2024-11-08 10:03:54,841 INFO L226 Difference]: Without dead ends: 37 [2024-11-08 10:03:54,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:03:54,843 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 42 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:03:54,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 35 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:03:54,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-08 10:03:54,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2024-11-08 10:03:54,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:54,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-08 10:03:54,853 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-11-08 10:03:54,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:03:54,854 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-08 10:03:54,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:54,854 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-08 10:03:54,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 10:03:54,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:03:54,854 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:03:54,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:03:54,854 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:03:54,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:03:54,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1209800511, now seen corresponding path program 1 times [2024-11-08 10:03:54,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:03:54,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446577576] [2024-11-08 10:03:54,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:03:54,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:03:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:03:54,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:03:54,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:03:54,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446577576] [2024-11-08 10:03:54,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446577576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:03:54,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:03:54,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:03:54,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856138297] [2024-11-08 10:03:54,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:03:54,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:03:54,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:03:54,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:03:54,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:03:54,916 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:54,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:03:54,948 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2024-11-08 10:03:54,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:03:54,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-08 10:03:54,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:03:54,949 INFO L225 Difference]: With dead ends: 58 [2024-11-08 10:03:54,949 INFO L226 Difference]: Without dead ends: 34 [2024-11-08 10:03:54,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:03:54,950 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 32 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:03:54,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 45 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:03:54,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-08 10:03:54,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-08 10:03:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-08 10:03:54,955 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2024-11-08 10:03:54,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:03:54,955 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-08 10:03:54,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-08 10:03:54,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 10:03:54,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:03:54,956 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:03:54,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:03:54,957 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:03:54,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:03:54,957 INFO L85 PathProgramCache]: Analyzing trace with hash -97783142, now seen corresponding path program 1 times [2024-11-08 10:03:54,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:03:54,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339385210] [2024-11-08 10:03:54,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:03:54,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:03:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:03:55,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 10:03:55,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:03:55,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339385210] [2024-11-08 10:03:55,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339385210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:03:55,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:03:55,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:03:55,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570547896] [2024-11-08 10:03:55,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:03:55,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:03:55,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:03:55,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:03:55,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:03:55,069 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:55,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:03:55,119 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2024-11-08 10:03:55,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:03:55,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-08 10:03:55,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:03:55,120 INFO L225 Difference]: With dead ends: 66 [2024-11-08 10:03:55,121 INFO L226 Difference]: Without dead ends: 54 [2024-11-08 10:03:55,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:03:55,122 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:03:55,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 38 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:03:55,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-08 10:03:55,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 31. [2024-11-08 10:03:55,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:55,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-11-08 10:03:55,131 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2024-11-08 10:03:55,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:03:55,132 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-08 10:03:55,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:55,132 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-11-08 10:03:55,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 10:03:55,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:03:55,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:03:55,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:03:55,133 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:03:55,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:03:55,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1661686170, now seen corresponding path program 1 times [2024-11-08 10:03:55,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:03:55,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171688754] [2024-11-08 10:03:55,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:03:55,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:03:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:03:55,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 10:03:55,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:03:55,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171688754] [2024-11-08 10:03:55,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171688754] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:03:55,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810924728] [2024-11-08 10:03:55,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:03:55,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:03:55,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:03:55,233 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:03:55,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 10:03:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:03:55,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 10:03:55,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:03:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 10:03:55,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:03:55,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 10:03:55,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810924728] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:03:55,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:03:55,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-08 10:03:55,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916546559] [2024-11-08 10:03:55,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:03:55,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 10:03:55,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:03:55,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 10:03:55,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-08 10:03:55,386 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:55,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:03:55,477 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2024-11-08 10:03:55,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 10:03:55,477 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-08 10:03:55,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:03:55,478 INFO L225 Difference]: With dead ends: 80 [2024-11-08 10:03:55,478 INFO L226 Difference]: Without dead ends: 52 [2024-11-08 10:03:55,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-11-08 10:03:55,479 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 66 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:03:55,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 75 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:03:55,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-08 10:03:55,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2024-11-08 10:03:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2024-11-08 10:03:55,496 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 25 [2024-11-08 10:03:55,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:03:55,496 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2024-11-08 10:03:55,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:55,496 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2024-11-08 10:03:55,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 10:03:55,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:03:55,497 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:03:55,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 10:03:55,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 10:03:55,702 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:03:55,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:03:55,702 INFO L85 PathProgramCache]: Analyzing trace with hash 53106109, now seen corresponding path program 2 times [2024-11-08 10:03:55,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:03:55,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866874358] [2024-11-08 10:03:55,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:03:55,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:03:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:03:55,842 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 10:03:55,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:03:55,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866874358] [2024-11-08 10:03:55,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866874358] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:03:55,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855217667] [2024-11-08 10:03:55,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 10:03:55,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:03:55,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:03:55,844 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:03:55,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 10:03:55,923 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 10:03:55,923 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:03:55,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 10:03:55,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:03:55,994 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 10:03:55,997 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:03:56,077 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 10:03:56,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855217667] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:03:56,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:03:56,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-11-08 10:03:56,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656689897] [2024-11-08 10:03:56,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:03:56,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 10:03:56,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:03:56,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 10:03:56,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2024-11-08 10:03:56,079 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:56,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:03:56,249 INFO L93 Difference]: Finished difference Result 137 states and 174 transitions. [2024-11-08 10:03:56,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 10:03:56,250 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-08 10:03:56,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:03:56,251 INFO L225 Difference]: With dead ends: 137 [2024-11-08 10:03:56,252 INFO L226 Difference]: Without dead ends: 94 [2024-11-08 10:03:56,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 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-11-08 10:03:56,253 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 137 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:03:56,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 199 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:03:56,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-08 10:03:56,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 76. [2024-11-08 10:03:56,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.24) internal successors, (93), 75 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:56,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2024-11-08 10:03:56,269 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 31 [2024-11-08 10:03:56,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:03:56,269 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2024-11-08 10:03:56,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:56,269 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2024-11-08 10:03:56,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 10:03:56,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:03:56,270 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:03:56,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 10:03:56,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-08 10:03:56,471 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:03:56,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:03:56,471 INFO L85 PathProgramCache]: Analyzing trace with hash 2141491421, now seen corresponding path program 3 times [2024-11-08 10:03:56,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:03:56,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066089288] [2024-11-08 10:03:56,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:03:56,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:03:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:03:56,768 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 55 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-08 10:03:56,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:03:56,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066089288] [2024-11-08 10:03:56,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066089288] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:03:56,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683162956] [2024-11-08 10:03:56,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 10:03:56,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:03:56,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:03:56,771 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:03:56,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 10:03:56,837 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-08 10:03:56,838 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:03:56,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 10:03:56,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:03:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-08 10:03:56,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:03:56,954 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-08 10:03:56,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683162956] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:03:56,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:03:56,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 4, 4] total 18 [2024-11-08 10:03:56,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34423200] [2024-11-08 10:03:56,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:03:56,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 10:03:56,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:03:56,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 10:03:56,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2024-11-08 10:03:56,956 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:57,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:03:57,881 INFO L93 Difference]: Finished difference Result 229 states and 269 transitions. [2024-11-08 10:03:57,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-08 10:03:57,881 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 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 43 [2024-11-08 10:03:57,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:03:57,882 INFO L225 Difference]: With dead ends: 229 [2024-11-08 10:03:57,882 INFO L226 Difference]: Without dead ends: 156 [2024-11-08 10:03:57,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1204 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1355, Invalid=2935, Unknown=0, NotChecked=0, Total=4290 [2024-11-08 10:03:57,884 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 362 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:03:57,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 113 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:03:57,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-08 10:03:57,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 132. [2024-11-08 10:03:57,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.1908396946564885) internal successors, (156), 131 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:57,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 156 transitions. [2024-11-08 10:03:57,904 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 156 transitions. Word has length 43 [2024-11-08 10:03:57,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:03:57,905 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 156 transitions. [2024-11-08 10:03:57,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:03:57,905 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 156 transitions. [2024-11-08 10:03:57,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 10:03:57,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:03:57,906 INFO L215 NwaCegarLoop]: trace histogram [44, 11, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:03:57,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 10:03:58,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:03:58,108 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:03:58,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:03:58,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1656562611, now seen corresponding path program 4 times [2024-11-08 10:03:58,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:03:58,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582874276] [2024-11-08 10:03:58,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:03:58,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:03:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:03:58,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 443 proven. 66 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2024-11-08 10:03:58,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:03:58,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582874276] [2024-11-08 10:03:58,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582874276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:03:58,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798600423] [2024-11-08 10:03:58,547 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 10:03:58,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:03:58,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:03:58,548 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:03:58,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 10:03:58,656 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 10:03:58,656 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:03:58,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-08 10:03:58,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:03:58,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 10:03:58,780 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 10:03:58,780 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 35 treesize of output 15 [2024-11-08 10:03:58,824 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 10:03:58,825 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 35 treesize of output 15 [2024-11-08 10:03:58,859 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 10:03:58,860 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 35 treesize of output 15 [2024-11-08 10:03:58,905 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 10:03:58,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 35 treesize of output 15 [2024-11-08 10:03:58,948 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 10:03:58,949 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 35 treesize of output 15 [2024-11-08 10:03:59,002 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 10:03:59,002 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 35 treesize of output 15 [2024-11-08 10:03:59,044 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 10:03:59,044 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 35 treesize of output 15 [2024-11-08 10:03:59,084 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 10:03:59,084 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 35 treesize of output 15 [2024-11-08 10:03:59,127 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 10:03:59,127 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 35 treesize of output 15 [2024-11-08 10:03:59,171 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 10:03:59,171 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 35 treesize of output 15 [2024-11-08 10:03:59,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 45 proven. 23 refuted. 0 times theorem prover too weak. 1178 trivial. 0 not checked. [2024-11-08 10:03:59,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:04:11,131 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_411 Int) (|v_ULTIMATE.start_main_~k~0#1_164| Int) (|v_ULTIMATE.start_main_~k~0#1_165| Int) (v_ArrVal_415 Int) (v_ArrVal_414 Int)) (or (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#B~0#1.base|) |c_ULTIMATE.start_main_~#B~0#1.offset|) (select (let ((.cse2 (* |c_ULTIMATE.start_main_~p~0#1| 4))) (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| .cse2)) (.cse1 (* (* |c_ULTIMATE.start_main_~n~0#1| .cse2) |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 .cse1 (* 4 |c_ULTIMATE.start_main_~k~0#1|)) v_ArrVal_411) (+ (* 4 |v_ULTIMATE.start_main_~k~0#1_165|) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1) v_ArrVal_414) (+ (* 4 |v_ULTIMATE.start_main_~k~0#1_164|) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1) v_ArrVal_415))) |c_ULTIMATE.start_main_~#A~0#1.offset|)) (< |v_ULTIMATE.start_main_~k~0#1_165| (+ |c_ULTIMATE.start_main_~k~0#1| 1)) (< |v_ULTIMATE.start_main_~k~0#1_164| (+ |v_ULTIMATE.start_main_~k~0#1_165| 1)))) is different from false [2024-11-08 10:04:15,166 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_411 Int) (v_ArrVal_409 Int) (|v_ULTIMATE.start_main_~k~0#1_164| Int) (|v_ULTIMATE.start_main_~k~0#1_165| Int) (v_ArrVal_415 Int) (|v_ULTIMATE.start_main_~k~0#1_166| Int) (v_ArrVal_414 Int)) (or (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#B~0#1.base|) |c_ULTIMATE.start_main_~#B~0#1.offset|) (select (let ((.cse2 (* |c_ULTIMATE.start_main_~p~0#1| 4))) (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| .cse2)) (.cse1 (* (* |c_ULTIMATE.start_main_~n~0#1| .cse2) |c_ULTIMATE.start_main_~i~0#1|))) (store (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 .cse1 (* 4 |c_ULTIMATE.start_main_~k~0#1|)) v_ArrVal_409) (+ (* 4 |v_ULTIMATE.start_main_~k~0#1_166|) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1) v_ArrVal_411) (+ (* 4 |v_ULTIMATE.start_main_~k~0#1_165|) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1) v_ArrVal_414) (+ (* 4 |v_ULTIMATE.start_main_~k~0#1_164|) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1) v_ArrVal_415))) |c_ULTIMATE.start_main_~#A~0#1.offset|)) (< |v_ULTIMATE.start_main_~k~0#1_165| (+ |v_ULTIMATE.start_main_~k~0#1_166| 1)) (< |v_ULTIMATE.start_main_~k~0#1_166| (+ |c_ULTIMATE.start_main_~k~0#1| 1)) (< |v_ULTIMATE.start_main_~k~0#1_164| (+ |v_ULTIMATE.start_main_~k~0#1_165| 1)))) is different from false [2024-11-08 10:04:19,216 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_411 Int) (v_ArrVal_409 Int) (|v_ULTIMATE.start_main_~k~0#1_164| Int) (|v_ULTIMATE.start_main_~k~0#1_165| Int) (v_ArrVal_407 Int) (v_ArrVal_415 Int) (|v_ULTIMATE.start_main_~k~0#1_166| Int) (v_ArrVal_414 Int) (|v_ULTIMATE.start_main_~k~0#1_167| Int)) (or (= (select (let ((.cse2 (* |c_ULTIMATE.start_main_~p~0#1| 4))) (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| .cse2)) (.cse1 (* (* |c_ULTIMATE.start_main_~n~0#1| .cse2) |c_ULTIMATE.start_main_~i~0#1|))) (store (store (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 .cse1 (* 4 |c_ULTIMATE.start_main_~k~0#1|)) v_ArrVal_407) (+ (* 4 |v_ULTIMATE.start_main_~k~0#1_167|) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1) v_ArrVal_409) (+ (* 4 |v_ULTIMATE.start_main_~k~0#1_166|) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1) v_ArrVal_411) (+ (* 4 |v_ULTIMATE.start_main_~k~0#1_165|) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1) v_ArrVal_414) (+ (* 4 |v_ULTIMATE.start_main_~k~0#1_164|) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1) v_ArrVal_415))) |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|)) (< |v_ULTIMATE.start_main_~k~0#1_167| (+ |c_ULTIMATE.start_main_~k~0#1| 1)) (< |v_ULTIMATE.start_main_~k~0#1_165| (+ |v_ULTIMATE.start_main_~k~0#1_166| 1)) (< |v_ULTIMATE.start_main_~k~0#1_166| (+ |v_ULTIMATE.start_main_~k~0#1_167| 1)) (< |v_ULTIMATE.start_main_~k~0#1_164| (+ |v_ULTIMATE.start_main_~k~0#1_165| 1)))) is different from false [2024-11-08 10:04:55,614 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_409 Int) (|v_ULTIMATE.start_main_~k~0#1_164| Int) (|v_ULTIMATE.start_main_~k~0#1_165| Int) (v_ArrVal_407 Int) (v_ArrVal_405 Int) (|v_ULTIMATE.start_main_~k~0#1_168| Int) (v_ArrVal_404 Int) (|v_ULTIMATE.start_main_~k~0#1_169| Int) (v_ArrVal_415 Int) (|v_ULTIMATE.start_main_~k~0#1_166| Int) (v_ArrVal_414 Int) (|v_ULTIMATE.start_main_~k~0#1_167| Int) (v_ArrVal_411 Int)) (or (< |v_ULTIMATE.start_main_~k~0#1_165| (+ |v_ULTIMATE.start_main_~k~0#1_166| 1)) (< |v_ULTIMATE.start_main_~k~0#1_169| (+ |c_ULTIMATE.start_main_~k~0#1| 1)) (= (select (let ((.cse2 (* |c_ULTIMATE.start_main_~p~0#1| 4))) (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| .cse2)) (.cse1 (* (* |c_ULTIMATE.start_main_~n~0#1| .cse2) |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (store (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 .cse1 (* 4 |c_ULTIMATE.start_main_~k~0#1|)) v_ArrVal_404) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| (* 4 |v_ULTIMATE.start_main_~k~0#1_169|) .cse0 .cse1) v_ArrVal_405) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1 (* 4 |v_ULTIMATE.start_main_~k~0#1_168|)) v_ArrVal_407) (+ (* 4 |v_ULTIMATE.start_main_~k~0#1_167|) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1) v_ArrVal_409) (+ (* 4 |v_ULTIMATE.start_main_~k~0#1_166|) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1) v_ArrVal_411) (+ (* 4 |v_ULTIMATE.start_main_~k~0#1_165|) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1) v_ArrVal_414) (+ (* 4 |v_ULTIMATE.start_main_~k~0#1_164|) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1) v_ArrVal_415))) |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|)) (< |v_ULTIMATE.start_main_~k~0#1_168| (+ |v_ULTIMATE.start_main_~k~0#1_169| 1)) (< |v_ULTIMATE.start_main_~k~0#1_167| (+ |v_ULTIMATE.start_main_~k~0#1_168| 1)) (< |v_ULTIMATE.start_main_~k~0#1_166| (+ |v_ULTIMATE.start_main_~k~0#1_167| 1)) (< |v_ULTIMATE.start_main_~k~0#1_164| (+ |v_ULTIMATE.start_main_~k~0#1_165| 1)))) is different from false [2024-11-08 10:04:57,152 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_409 Int) (|v_ULTIMATE.start_main_~k~0#1_164| Int) (|v_ULTIMATE.start_main_~k~0#1_165| Int) (v_ArrVal_407 Int) (v_ArrVal_405 Int) (|v_ULTIMATE.start_main_~k~0#1_168| Int) (v_ArrVal_404 Int) (|v_ULTIMATE.start_main_~k~0#1_169| Int) (v_ArrVal_415 Int) (|v_ULTIMATE.start_main_~k~0#1_166| Int) (v_ArrVal_414 Int) (|v_ULTIMATE.start_main_~k~0#1_167| Int) (v_ArrVal_401 Int) (v_ArrVal_411 Int) (|v_ULTIMATE.start_main_~k~0#1_170| Int)) (or (= (select (let ((.cse2 (* |c_ULTIMATE.start_main_~p~0#1| 4))) (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| .cse2)) (.cse1 (* (* |c_ULTIMATE.start_main_~n~0#1| .cse2) |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (store (store (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 .cse1 (* 4 |c_ULTIMATE.start_main_~k~0#1|)) v_ArrVal_401) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| (* 4 |v_ULTIMATE.start_main_~k~0#1_170|) .cse0 .cse1) v_ArrVal_404) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| (* 4 |v_ULTIMATE.start_main_~k~0#1_169|) .cse0 .cse1) v_ArrVal_405) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1 (* 4 |v_ULTIMATE.start_main_~k~0#1_168|)) v_ArrVal_407) (+ (* 4 |v_ULTIMATE.start_main_~k~0#1_167|) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1) v_ArrVal_409) (+ (* 4 |v_ULTIMATE.start_main_~k~0#1_166|) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1) v_ArrVal_411) (+ (* 4 |v_ULTIMATE.start_main_~k~0#1_165|) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1) v_ArrVal_414) (+ (* 4 |v_ULTIMATE.start_main_~k~0#1_164|) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1) v_ArrVal_415))) |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|)) (< |v_ULTIMATE.start_main_~k~0#1_165| (+ |v_ULTIMATE.start_main_~k~0#1_166| 1)) (< |v_ULTIMATE.start_main_~k~0#1_169| (+ |v_ULTIMATE.start_main_~k~0#1_170| 1)) (< |v_ULTIMATE.start_main_~k~0#1_168| (+ |v_ULTIMATE.start_main_~k~0#1_169| 1)) (< |v_ULTIMATE.start_main_~k~0#1_167| (+ |v_ULTIMATE.start_main_~k~0#1_168| 1)) (< |v_ULTIMATE.start_main_~k~0#1_166| (+ |v_ULTIMATE.start_main_~k~0#1_167| 1)) (< |v_ULTIMATE.start_main_~k~0#1_170| (+ |c_ULTIMATE.start_main_~k~0#1| 1)) (< |v_ULTIMATE.start_main_~k~0#1_164| (+ |v_ULTIMATE.start_main_~k~0#1_165| 1)))) is different from false