./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-2.i -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 a135e953d64ed0fec81eb2a1e42f4031e3e387fc71d5a5cd2177772a202dc706 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:22:38,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:22:38,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:22:38,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:22:38,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:22:38,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:22:38,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:22:38,302 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:22:38,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:22:38,304 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:22:38,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:22:38,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:22:38,305 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:22:38,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:22:38,308 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:22:38,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:22:38,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:22:38,308 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:22:38,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:22:38,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:22:38,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:22:38,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:22:38,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:22:38,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:22:38,313 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:22:38,313 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:22:38,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:22:38,314 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:22:38,314 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:22:38,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:22:38,314 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:22:38,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:22:38,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:22:38,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:22:38,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:22:38,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:22:38,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:22:38,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:22:38,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:22:38,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:22:38,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:22:38,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:22:38,318 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 -> a135e953d64ed0fec81eb2a1e42f4031e3e387fc71d5a5cd2177772a202dc706 [2024-10-12 18:22:38,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:22:38,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:22:38,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:22:38,653 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:22:38,653 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:22:38,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-2.i [2024-10-12 18:22:40,173 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:22:40,448 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:22:40,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-2.i [2024-10-12 18:22:40,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8418f0eea/7fbba32670aa4e1ab8ff79cb4b9db992/FLAG8ac6d7b57 [2024-10-12 18:22:40,476 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8418f0eea/7fbba32670aa4e1ab8ff79cb4b9db992 [2024-10-12 18:22:40,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:22:40,480 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:22:40,482 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:22:40,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:22:40,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:22:40,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:22:40" (1/1) ... [2024-10-12 18:22:40,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49d85bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:40, skipping insertion in model container [2024-10-12 18:22:40,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:22:40" (1/1) ... [2024-10-12 18:22:40,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:22:40,878 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-2.i[23408,23421] [2024-10-12 18:22:40,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:22:40,904 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:22:40,944 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-2.i[23408,23421] [2024-10-12 18:22:40,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:22:40,981 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:22:40,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:40 WrapperNode [2024-10-12 18:22:40,982 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:22:40,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:22:40,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:22:40,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:22:40,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:40" (1/1) ... [2024-10-12 18:22:41,008 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:40" (1/1) ... [2024-10-12 18:22:41,030 INFO L138 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2024-10-12 18:22:41,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:22:41,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:22:41,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:22:41,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:22:41,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:40" (1/1) ... [2024-10-12 18:22:41,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:40" (1/1) ... [2024-10-12 18:22:41,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:40" (1/1) ... [2024-10-12 18:22:41,074 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [2, 12]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-10-12 18:22:41,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:40" (1/1) ... [2024-10-12 18:22:41,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:40" (1/1) ... [2024-10-12 18:22:41,086 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:40" (1/1) ... [2024-10-12 18:22:41,090 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:40" (1/1) ... [2024-10-12 18:22:41,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:40" (1/1) ... [2024-10-12 18:22:41,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:40" (1/1) ... [2024-10-12 18:22:41,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:22:41,105 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:22:41,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:22:41,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:22:41,109 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:40" (1/1) ... [2024-10-12 18:22:41,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:22:41,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:22:41,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 18:22:41,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 18:22:41,197 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-10-12 18:22:41,198 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-10-12 18:22:41,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 18:22:41,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 18:22:41,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 18:22:41,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 18:22:41,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-12 18:22:41,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:22:41,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 18:22:41,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 18:22:41,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 18:22:41,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 18:22:41,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:22:41,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 18:22:41,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:22:41,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:22:41,357 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:22:41,360 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:22:41,382 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-10-12 18:22:41,525 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-12 18:22:41,526 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:22:41,562 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:22:41,562 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-12 18:22:41,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:22:41 BoogieIcfgContainer [2024-10-12 18:22:41,565 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:22:41,568 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:22:41,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:22:41,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:22:41,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:22:40" (1/3) ... [2024-10-12 18:22:41,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75608e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:22:41, skipping insertion in model container [2024-10-12 18:22:41,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:22:40" (2/3) ... [2024-10-12 18:22:41,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75608e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:22:41, skipping insertion in model container [2024-10-12 18:22:41,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:22:41" (3/3) ... [2024-10-12 18:22:41,577 INFO L112 eAbstractionObserver]: Analyzing ICFG list-2.i [2024-10-12 18:22:41,592 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:22:41,593 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:22:41,641 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:22:41,648 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;@576f224f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:22:41,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:22:41,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 25 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:22:41,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-12 18:22:41,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:22:41,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:22:41,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:22:41,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:22:41,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1831991699, now seen corresponding path program 1 times [2024-10-12 18:22:41,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:22:41,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027817785] [2024-10-12 18:22:41,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:41,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:22:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:41,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:41,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:22:41,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027817785] [2024-10-12 18:22:41,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027817785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:22:41,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:22:41,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 18:22:41,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801464014] [2024-10-12 18:22:41,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:22:41,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 18:22:41,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:22:41,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 18:22:41,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:22:41,901 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 25 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 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-10-12 18:22:41,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:22:41,932 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2024-10-12 18:22:41,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 18:22:41,935 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-10-12 18:22:41,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:22:41,942 INFO L225 Difference]: With dead ends: 45 [2024-10-12 18:22:41,942 INFO L226 Difference]: Without dead ends: 20 [2024-10-12 18:22:41,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:22:41,948 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:22:41,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:22:41,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-12 18:22:41,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-12 18:22:41,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:22:41,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-10-12 18:22:41,983 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 11 [2024-10-12 18:22:41,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:22:41,984 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-10-12 18:22:41,984 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-10-12 18:22:41,984 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-10-12 18:22:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 18:22:41,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:22:41,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:22:41,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:22:41,987 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:22:41,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:22:41,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1175607717, now seen corresponding path program 1 times [2024-10-12 18:22:41,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:22:41,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100052345] [2024-10-12 18:22:41,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:41,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:22:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:42,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:42,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:22:42,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100052345] [2024-10-12 18:22:42,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100052345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:22:42,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:22:42,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:22:42,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385405611] [2024-10-12 18:22:42,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:22:42,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:22:42,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:22:42,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:22:42,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:22:42,345 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:22:42,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:22:42,416 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-10-12 18:22:42,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:22:42,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-12 18:22:42,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:22:42,418 INFO L225 Difference]: With dead ends: 37 [2024-10-12 18:22:42,418 INFO L226 Difference]: Without dead ends: 33 [2024-10-12 18:22:42,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:22:42,419 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:22:42,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 44 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:22:42,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-12 18:22:42,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2024-10-12 18:22:42,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.25) internal successors, (35), 28 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-10-12 18:22:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-10-12 18:22:42,427 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 15 [2024-10-12 18:22:42,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:22:42,427 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-10-12 18:22:42,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:22:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-10-12 18:22:42,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 18:22:42,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:22:42,429 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:22:42,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:22:42,429 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:22:42,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:22:42,430 INFO L85 PathProgramCache]: Analyzing trace with hash 231293632, now seen corresponding path program 1 times [2024-10-12 18:22:42,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:22:42,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498185407] [2024-10-12 18:22:42,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:42,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:22:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:42,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:42,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:22:42,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498185407] [2024-10-12 18:22:42,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498185407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:22:42,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:22:42,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:22:42,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594086931] [2024-10-12 18:22:42,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:22:42,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:22:42,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:22:42,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:22:42,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:22:42,660 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-10-12 18:22:42,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:22:42,737 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2024-10-12 18:22:42,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:22:42,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-10-12 18:22:42,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:22:42,740 INFO L225 Difference]: With dead ends: 39 [2024-10-12 18:22:42,740 INFO L226 Difference]: Without dead ends: 31 [2024-10-12 18:22:42,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:22:42,743 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:22:42,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 47 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:22:42,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-12 18:22:42,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-10-12 18:22:42,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 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-10-12 18:22:42,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-10-12 18:22:42,754 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 17 [2024-10-12 18:22:42,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:22:42,754 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-10-12 18:22:42,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-10-12 18:22:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-10-12 18:22:42,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 18:22:42,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:22:42,756 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:22:42,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 18:22:42,757 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:22:42,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:22:42,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1255996608, now seen corresponding path program 1 times [2024-10-12 18:22:42,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:22:42,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266518584] [2024-10-12 18:22:42,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:42,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:22:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:42,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:42,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:22:42,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266518584] [2024-10-12 18:22:42,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266518584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:22:42,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:22:42,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:22:42,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241280846] [2024-10-12 18:22:42,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:22:42,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:22:42,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:22:42,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:22:42,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:22:42,891 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-10-12 18:22:42,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:22:42,954 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2024-10-12 18:22:42,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:22:42,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-10-12 18:22:42,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:22:42,955 INFO L225 Difference]: With dead ends: 39 [2024-10-12 18:22:42,957 INFO L226 Difference]: Without dead ends: 28 [2024-10-12 18:22:42,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:22:42,962 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:22:42,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 51 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:22:42,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-12 18:22:42,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2024-10-12 18:22:42,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:22:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-10-12 18:22:42,989 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 17 [2024-10-12 18:22:42,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:22:42,989 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-10-12 18:22:42,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-10-12 18:22:42,990 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-10-12 18:22:42,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 18:22:42,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:22:42,990 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:22:42,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 18:22:42,991 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:22:42,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:22:42,993 INFO L85 PathProgramCache]: Analyzing trace with hash -423740148, now seen corresponding path program 1 times [2024-10-12 18:22:42,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:22:42,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582137662] [2024-10-12 18:22:42,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:42,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:22:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:43,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:22:43,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582137662] [2024-10-12 18:22:43,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582137662] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:22:43,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629557888] [2024-10-12 18:22:43,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:43,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:22:43,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:22:43,339 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-10-12 18:22:43,342 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-10-12 18:22:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:43,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-12 18:22:43,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:22:43,558 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 11 treesize of output 7 [2024-10-12 18:22:43,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-12 18:22:43,723 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-12 18:22:43,724 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 19 treesize of output 22 [2024-10-12 18:22:43,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:43,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:22:44,225 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_81 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_29| Int)) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_81))) (or (not (= v_ArrVal_81 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_81 .cse0))))) (= (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2) (= (select (select (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_29| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_29|) |c_ULTIMATE.start_main_~t~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)))) is different from false [2024-10-12 18:22:44,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:44,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 237 treesize of output 247 [2024-10-12 18:22:44,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 18:22:44,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 93 [2024-10-12 18:22:44,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:44,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629557888] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:22:44,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:22:44,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 22 [2024-10-12 18:22:44,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310121264] [2024-10-12 18:22:44,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:22:44,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-12 18:22:44,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:22:44,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-12 18:22:44,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=352, Unknown=1, NotChecked=38, Total=462 [2024-10-12 18:22:44,543 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:22:45,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:22:45,005 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2024-10-12 18:22:45,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 18:22:45,006 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-12 18:22:45,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:22:45,008 INFO L225 Difference]: With dead ends: 52 [2024-10-12 18:22:45,008 INFO L226 Difference]: Without dead ends: 44 [2024-10-12 18:22:45,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=169, Invalid=826, Unknown=1, NotChecked=60, Total=1056 [2024-10-12 18:22:45,011 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 40 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:22:45,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 153 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 228 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2024-10-12 18:22:45,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-12 18:22:45,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2024-10-12 18:22:45,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:22:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2024-10-12 18:22:45,024 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 19 [2024-10-12 18:22:45,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:22:45,024 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2024-10-12 18:22:45,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:22:45,025 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2024-10-12 18:22:45,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 18:22:45,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:22:45,025 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:22:45,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 18:22:45,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:22:45,226 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:22:45,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:22:45,227 INFO L85 PathProgramCache]: Analyzing trace with hash 439661516, now seen corresponding path program 1 times [2024-10-12 18:22:45,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:22:45,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395709958] [2024-10-12 18:22:45,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:45,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:22:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:45,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:45,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:22:45,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395709958] [2024-10-12 18:22:45,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395709958] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:22:45,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10611243] [2024-10-12 18:22:45,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:45,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:22:45,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:22:45,481 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-10-12 18:22:45,485 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-10-12 18:22:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:45,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-12 18:22:45,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:22:45,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-10-12 18:22:45,605 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-12 18:22:45,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-12 18:22:45,613 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 11 treesize of output 7 [2024-10-12 18:22:45,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-12 18:22:45,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:22:45,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:45,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:22:45,746 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_130 (Array Int Int)) (v_ArrVal_133 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_130) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_133) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_130 .cse0))) v_ArrVal_130)))) is different from false [2024-10-12 18:22:45,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:45,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 74 [2024-10-12 18:22:45,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2024-10-12 18:22:45,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-12 18:22:45,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2024-10-12 18:22:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:45,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10611243] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:22:45,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:22:45,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-10-12 18:22:45,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483873403] [2024-10-12 18:22:45,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:22:45,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 18:22:45,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:22:45,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 18:22:45,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=101, Unknown=3, NotChecked=20, Total=156 [2024-10-12 18:22:45,903 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:22:46,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:22:46,079 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2024-10-12 18:22:46,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 18:22:46,080 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 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 19 [2024-10-12 18:22:46,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:22:46,081 INFO L225 Difference]: With dead ends: 59 [2024-10-12 18:22:46,081 INFO L226 Difference]: Without dead ends: 55 [2024-10-12 18:22:46,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=180, Unknown=3, NotChecked=28, Total=272 [2024-10-12 18:22:46,082 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:22:46,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 110 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 132 Invalid, 0 Unknown, 42 Unchecked, 0.1s Time] [2024-10-12 18:22:46,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-12 18:22:46,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2024-10-12 18:22:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 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-10-12 18:22:46,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2024-10-12 18:22:46,089 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 19 [2024-10-12 18:22:46,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:22:46,089 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-10-12 18:22:46,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:22:46,090 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2024-10-12 18:22:46,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 18:22:46,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:22:46,091 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:22:46,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 18:22:46,294 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,SelfDestructingSolverStorable5 [2024-10-12 18:22:46,295 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:22:46,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:22:46,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1880990311, now seen corresponding path program 1 times [2024-10-12 18:22:46,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:22:46,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663841889] [2024-10-12 18:22:46,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:46,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:22:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:46,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:46,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:22:46,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663841889] [2024-10-12 18:22:46,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663841889] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:22:46,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992777927] [2024-10-12 18:22:46,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:46,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:22:46,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:22:46,696 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-10-12 18:22:46,698 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-10-12 18:22:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:46,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-12 18:22:46,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:22:46,902 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 11 treesize of output 7 [2024-10-12 18:22:46,913 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 1 [2024-10-12 18:22:46,967 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2024-10-12 18:22:46,967 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 51 [2024-10-12 18:22:46,983 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-12 18:22:46,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2024-10-12 18:22:46,989 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 9 [2024-10-12 18:22:47,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-12 18:22:47,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 18:22:47,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-12 18:22:47,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:47,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:22:47,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:47,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 97 [2024-10-12 18:22:47,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:47,303 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-10-12 18:22:47,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:47,312 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-10-12 18:22:47,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:47,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2024-10-12 18:22:47,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:47,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2024-10-12 18:22:47,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2024-10-12 18:22:47,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2024-10-12 18:22:47,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:47,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992777927] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:22:47,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:22:47,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2024-10-12 18:22:47,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965359088] [2024-10-12 18:22:47,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:22:47,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-12 18:22:47,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:22:47,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-12 18:22:47,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2024-10-12 18:22:47,472 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:22:47,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:22:47,876 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2024-10-12 18:22:47,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 18:22:47,877 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 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 21 [2024-10-12 18:22:47,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:22:47,878 INFO L225 Difference]: With dead ends: 72 [2024-10-12 18:22:47,878 INFO L226 Difference]: Without dead ends: 61 [2024-10-12 18:22:47,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2024-10-12 18:22:47,879 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:22:47,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 134 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:22:47,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-12 18:22:47,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2024-10-12 18:22:47,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:22:47,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2024-10-12 18:22:47,896 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 21 [2024-10-12 18:22:47,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:22:47,896 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2024-10-12 18:22:47,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:22:47,897 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2024-10-12 18:22:47,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 18:22:47,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:22:47,899 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:22:47,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 18:22:48,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:22:48,104 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:22:48,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:22:48,105 INFO L85 PathProgramCache]: Analyzing trace with hash -500866302, now seen corresponding path program 1 times [2024-10-12 18:22:48,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:22:48,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334285084] [2024-10-12 18:22:48,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:48,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:22:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:48,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:48,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:22:48,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334285084] [2024-10-12 18:22:48,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334285084] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:22:48,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753098495] [2024-10-12 18:22:48,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:48,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:22:48,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:22:48,458 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-10-12 18:22:48,460 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-10-12 18:22:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:48,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-12 18:22:48,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:22:48,631 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 1 [2024-10-12 18:22:48,635 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 11 treesize of output 7 [2024-10-12 18:22:48,689 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2024-10-12 18:22:48,689 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 51 [2024-10-12 18:22:48,705 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-12 18:22:48,705 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 20 treesize of output 17 [2024-10-12 18:22:48,710 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 9 [2024-10-12 18:22:48,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-12 18:22:48,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 18:22:48,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-12 18:22:48,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:48,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:22:48,962 INFO L349 Elim1Store]: treesize reduction 4, result has 86.2 percent of original size [2024-10-12 18:22:48,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 66 [2024-10-12 18:22:49,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:49,145 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 152 [2024-10-12 18:22:49,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:49,159 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 112 [2024-10-12 18:22:49,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:49,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 148 [2024-10-12 18:22:49,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:49,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 173 [2024-10-12 18:22:49,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 153 [2024-10-12 18:22:49,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 149 [2024-10-12 18:22:49,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 141 [2024-10-12 18:22:49,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 137 [2024-10-12 18:22:49,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 133 [2024-10-12 18:22:49,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 125 [2024-10-12 18:22:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:49,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753098495] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:22:49,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:22:49,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2024-10-12 18:22:49,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118109274] [2024-10-12 18:22:49,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:22:49,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-12 18:22:49,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:22:49,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-12 18:22:49,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2024-10-12 18:22:49,374 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 21 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-10-12 18:22:49,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:22:49,832 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2024-10-12 18:22:49,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 18:22:49,833 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 21 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 23 [2024-10-12 18:22:49,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:22:49,833 INFO L225 Difference]: With dead ends: 67 [2024-10-12 18:22:49,834 INFO L226 Difference]: Without dead ends: 47 [2024-10-12 18:22:49,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=948, Unknown=0, NotChecked=0, Total=1122 [2024-10-12 18:22:49,835 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 51 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:22:49,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 131 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 18:22:49,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-12 18:22:49,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2024-10-12 18:22:49,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:22:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2024-10-12 18:22:49,840 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 23 [2024-10-12 18:22:49,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:22:49,841 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-10-12 18:22:49,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 21 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-10-12 18:22:49,841 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-10-12 18:22:49,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 18:22:49,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:22:49,842 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:22:49,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 18:22:50,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:22:50,047 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:22:50,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:22:50,047 INFO L85 PathProgramCache]: Analyzing trace with hash -800511053, now seen corresponding path program 1 times [2024-10-12 18:22:50,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:22:50,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61036162] [2024-10-12 18:22:50,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:50,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:22:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:50,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:22:50,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61036162] [2024-10-12 18:22:50,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61036162] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:22:50,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746118743] [2024-10-12 18:22:50,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:50,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:22:50,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:22:50,478 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:22:50,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 18:22:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:50,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-12 18:22:50,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:22:50,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-10-12 18:22:50,597 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 11 treesize of output 7 [2024-10-12 18:22:50,606 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-12 18:22:50,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-12 18:22:50,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 18:22:50,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-12 18:22:50,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-12 18:22:50,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:22:50,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:22:50,768 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-12 18:22:50,769 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 19 treesize of output 22 [2024-10-12 18:22:50,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:50,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:22:50,986 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_317 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_57| Int)) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_317))) (or (= 3 (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_57| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_57|) |c_ULTIMATE.start_main_~t~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) is different from false [2024-10-12 18:22:51,004 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_317 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_57| Int)) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_317))) (or (= 3 (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_57| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_57|) 0 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) is different from false [2024-10-12 18:22:51,037 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_317 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_57| Int) (v_ArrVal_311 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_317))) (or (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_57| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_57|) 0 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1 (select v_ArrVal_311 .cse1))) v_ArrVal_311))))) is different from false [2024-10-12 18:22:51,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:51,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1209 treesize of output 1195 [2024-10-12 18:22:51,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 654 treesize of output 618 [2024-10-12 18:22:52,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 18:22:52,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 185 [2024-10-12 18:22:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-12 18:22:52,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746118743] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:22:52,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:22:52,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2024-10-12 18:22:52,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13965658] [2024-10-12 18:22:52,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:22:52,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-12 18:22:52,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:22:52,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-12 18:22:52,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=316, Unknown=3, NotChecked=114, Total=506 [2024-10-12 18:22:52,602 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:22:53,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:22:53,051 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2024-10-12 18:22:53,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-12 18:22:53,052 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-12 18:22:53,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:22:53,052 INFO L225 Difference]: With dead ends: 76 [2024-10-12 18:22:53,053 INFO L226 Difference]: Without dead ends: 71 [2024-10-12 18:22:53,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=759, Unknown=3, NotChecked=180, Total=1122 [2024-10-12 18:22:53,054 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 56 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:22:53,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 164 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 223 Invalid, 0 Unknown, 205 Unchecked, 0.2s Time] [2024-10-12 18:22:53,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-12 18:22:53,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 49. [2024-10-12 18:22:53,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:22:53,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2024-10-12 18:22:53,066 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 23 [2024-10-12 18:22:53,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:22:53,066 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2024-10-12 18:22:53,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:22:53,067 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2024-10-12 18:22:53,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 18:22:53,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:22:53,068 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:22:53,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 18:22:53,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:22:53,269 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:22:53,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:22:53,270 INFO L85 PathProgramCache]: Analyzing trace with hash -694066546, now seen corresponding path program 1 times [2024-10-12 18:22:53,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:22:53,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645184580] [2024-10-12 18:22:53,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:53,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:22:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:53,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:53,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:22:53,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645184580] [2024-10-12 18:22:53,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645184580] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:22:53,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612841417] [2024-10-12 18:22:53,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:53,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:22:53,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:22:53,764 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:22:53,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 18:22:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:53,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-12 18:22:53,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:22:53,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-10-12 18:22:53,902 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 11 treesize of output 7 [2024-10-12 18:22:53,910 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-12 18:22:53,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-12 18:22:53,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-12 18:22:53,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:22:53,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-12 18:22:54,013 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-12 18:22:54,014 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 19 treesize of output 22 [2024-10-12 18:22:54,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:54,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2024-10-12 18:22:54,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:54,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:22:54,143 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_65| Int) (v_ArrVal_398 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_398))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_65| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_65|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2024-10-12 18:22:54,152 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_65| Int) (v_ArrVal_398 (Array Int Int))) (not (= 1 (select (select (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_398))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_65| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_65|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2024-10-12 18:22:54,166 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_65| Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_398 (Array Int Int))) (or (not (= v_ArrVal_396 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_396 .cse0))))) (not (= (select (select (let ((.cse1 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_398))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_65| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_65|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) is different from false [2024-10-12 18:22:54,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:54,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 585 treesize of output 591 [2024-10-12 18:22:54,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 550 treesize of output 518 [2024-10-12 18:22:54,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-12 18:22:54,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 92 [2024-10-12 18:22:54,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:22:54,640 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-12 18:22:54,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612841417] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:22:54,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:22:54,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2024-10-12 18:22:54,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229161164] [2024-10-12 18:22:54,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:22:54,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-12 18:22:54,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:22:54,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-12 18:22:54,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=354, Unknown=3, NotChecked=120, Total=552 [2024-10-12 18:22:54,642 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 23 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:22:55,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:22:55,034 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2024-10-12 18:22:55,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 18:22:55,035 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 23 states have internal predecessors, (55), 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-10-12 18:22:55,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:22:55,036 INFO L225 Difference]: With dead ends: 78 [2024-10-12 18:22:55,036 INFO L226 Difference]: Without dead ends: 70 [2024-10-12 18:22:55,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=878, Unknown=3, NotChecked=192, Total=1260 [2024-10-12 18:22:55,037 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:22:55,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 129 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 227 Invalid, 0 Unknown, 156 Unchecked, 0.2s Time] [2024-10-12 18:22:55,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-12 18:22:55,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2024-10-12 18:22:55,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.196969696969697) internal successors, (79), 66 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:22:55,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2024-10-12 18:22:55,059 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 25 [2024-10-12 18:22:55,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:22:55,060 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2024-10-12 18:22:55,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 23 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:22:55,060 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2024-10-12 18:22:55,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 18:22:55,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:22:55,062 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:22:55,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-12 18:22:55,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:22:55,264 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:22:55,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:22:55,266 INFO L85 PathProgramCache]: Analyzing trace with hash 330636430, now seen corresponding path program 2 times [2024-10-12 18:22:55,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:22:55,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712411844] [2024-10-12 18:22:55,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:55,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:22:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:22:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:55,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:22:55,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712411844] [2024-10-12 18:22:55,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712411844] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:22:55,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26270553] [2024-10-12 18:22:55,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 18:22:55,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:22:55,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:22:55,835 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:22:55,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 18:22:55,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 18:22:55,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:22:55,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-10-12 18:22:55,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:22:55,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-10-12 18:22:56,008 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:22:56,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-12 18:22:56,054 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 1 [2024-10-12 18:22:56,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 18:22:56,119 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-12 18:22:56,120 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 16 treesize of output 15 [2024-10-12 18:22:56,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-12 18:22:56,131 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 11 treesize of output 7 [2024-10-12 18:22:56,144 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-12 18:22:56,144 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 33 treesize of output 24 [2024-10-12 18:22:56,160 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-12 18:22:56,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-12 18:22:56,239 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2024-10-12 18:22:56,240 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 125 [2024-10-12 18:22:56,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 105 [2024-10-12 18:22:56,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2024-10-12 18:22:56,341 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-10-12 18:22:56,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 135 [2024-10-12 18:22:56,354 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-12 18:22:56,355 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 121 [2024-10-12 18:22:56,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 19 [2024-10-12 18:22:56,409 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-10-12 18:22:56,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 30 [2024-10-12 18:22:56,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 18:22:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:22:56,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:22:56,471 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_490) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_488) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_489) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 2)) is different from false [2024-10-12 18:22:56,488 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int)) (v_ArrVal_489 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_490) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_488) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_486) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_489) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 2) (not (= v_ArrVal_485 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_485 .cse0))))))) is different from false [2024-10-12 18:22:56,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:56,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 42 treesize of output 46 [2024-10-12 18:22:56,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:56,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 262 treesize of output 266 [2024-10-12 18:22:56,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 190 [2024-10-12 18:22:56,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 329 treesize of output 293 [2024-10-12 18:22:56,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-10-12 18:22:56,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-10-12 18:22:56,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:56,836 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2024-10-12 18:22:56,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:56,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 154 [2024-10-12 18:22:56,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2024-10-12 18:22:56,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2024-10-12 18:22:56,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:56,893 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2024-10-12 18:22:56,896 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:22:56,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:56,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2024-10-12 18:22:56,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:56,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2024-10-12 18:22:56,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:56,961 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-10-12 18:22:56,964 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:22:56,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:56,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-10-12 18:22:56,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:56,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2024-10-12 18:22:57,002 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-10-12 18:22:57,003 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 1 [2024-10-12 18:22:57,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:57,010 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-10-12 18:22:57,012 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-12 18:22:57,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:22:57,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2024-10-12 18:22:57,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 18:22:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-12 18:22:57,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26270553] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:22:57,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:22:57,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2024-10-12 18:22:57,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425631623] [2024-10-12 18:22:57,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:22:57,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-12 18:22:57,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:22:57,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-12 18:22:57,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=436, Unknown=3, NotChecked=86, Total=600 [2024-10-12 18:22:57,729 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 25 states, 25 states have (on average 2.28) internal successors, (57), 24 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-10-12 18:22:58,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:22:58,185 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2024-10-12 18:22:58,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 18:22:58,185 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.28) internal successors, (57), 24 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) Word has length 25 [2024-10-12 18:22:58,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:22:58,186 INFO L225 Difference]: With dead ends: 87 [2024-10-12 18:22:58,186 INFO L226 Difference]: Without dead ends: 81 [2024-10-12 18:22:58,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=118, Invalid=643, Unknown=3, NotChecked=106, Total=870 [2024-10-12 18:22:58,188 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 45 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 18:22:58,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 159 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 306 Invalid, 0 Unknown, 103 Unchecked, 0.3s Time] [2024-10-12 18:22:58,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-12 18:22:58,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2024-10-12 18:22:58,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 73 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:22:58,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2024-10-12 18:22:58,206 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 25 [2024-10-12 18:22:58,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:22:58,207 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2024-10-12 18:22:58,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.28) internal successors, (57), 24 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-10-12 18:22:58,207 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2024-10-12 18:22:58,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 18:22:58,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:22:58,207 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:22:58,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-12 18:22:58,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:22:58,409 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:22:58,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:22:58,409 INFO L85 PathProgramCache]: Analyzing trace with hash -443299506, now seen corresponding path program 1 times [2024-10-12 18:22:58,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:22:58,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963707883] [2024-10-12 18:22:58,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:22:58,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:22:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 18:22:58,426 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 18:22:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 18:22:58,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 18:22:58,461 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 18:22:58,462 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 18:22:58,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 18:22:58,466 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:22:58,493 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 18:22:58,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 06:22:58 BoogieIcfgContainer [2024-10-12 18:22:58,495 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 18:22:58,496 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 18:22:58,496 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 18:22:58,496 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 18:22:58,498 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:22:41" (3/4) ... [2024-10-12 18:22:58,498 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 18:22:58,541 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 18:22:58,541 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 18:22:58,542 INFO L158 Benchmark]: Toolchain (without parser) took 18061.65ms. Allocated memory was 169.9MB in the beginning and 438.3MB in the end (delta: 268.4MB). Free memory was 138.8MB in the beginning and 176.3MB in the end (delta: -37.5MB). Peak memory consumption was 230.1MB. Max. memory is 16.1GB. [2024-10-12 18:22:58,542 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory was 76.2MB in the beginning and 76.0MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:22:58,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.90ms. Allocated memory is still 169.9MB. Free memory was 138.0MB in the beginning and 119.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-12 18:22:58,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.19ms. Allocated memory is still 169.9MB. Free memory was 119.1MB in the beginning and 117.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 18:22:58,543 INFO L158 Benchmark]: Boogie Preprocessor took 71.91ms. Allocated memory is still 169.9MB. Free memory was 117.0MB in the beginning and 114.8MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 18:22:58,543 INFO L158 Benchmark]: RCFGBuilder took 461.09ms. Allocated memory is still 169.9MB. Free memory was 114.8MB in the beginning and 130.6MB in the end (delta: -15.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 18:22:58,543 INFO L158 Benchmark]: TraceAbstraction took 16927.10ms. Allocated memory was 169.9MB in the beginning and 438.3MB in the end (delta: 268.4MB). Free memory was 129.5MB in the beginning and 178.4MB in the end (delta: -48.9MB). Peak memory consumption was 220.5MB. Max. memory is 16.1GB. [2024-10-12 18:22:58,543 INFO L158 Benchmark]: Witness Printer took 45.59ms. Allocated memory is still 438.3MB. Free memory was 178.4MB in the beginning and 176.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 18:22:58,545 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory was 76.2MB in the beginning and 76.0MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.90ms. Allocated memory is still 169.9MB. Free memory was 138.0MB in the beginning and 119.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.19ms. Allocated memory is still 169.9MB. Free memory was 119.1MB in the beginning and 117.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.91ms. Allocated memory is still 169.9MB. Free memory was 117.0MB in the beginning and 114.8MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 461.09ms. Allocated memory is still 169.9MB. Free memory was 114.8MB in the beginning and 130.6MB in the end (delta: -15.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 16927.10ms. Allocated memory was 169.9MB in the beginning and 438.3MB in the end (delta: 268.4MB). Free memory was 129.5MB in the beginning and 178.4MB in the end (delta: -48.9MB). Peak memory consumption was 220.5MB. Max. memory is 16.1GB. * Witness Printer took 45.59ms. Allocated memory is still 438.3MB. Free memory was 178.4MB in the beginning and 176.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 557]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L532] List a = (List) malloc(sizeof(struct node)); [L533] COND FALSE !(a == 0) VAL [a={-1:0}] [L534] List t; [L535] List p = a; VAL [a={-1:0}, p={-1:0}] [L536] COND TRUE __VERIFIER_nondet_int() [L537] p->h = 1 [L538] t = (List) malloc(sizeof(struct node)) [L539] COND FALSE !(t == 0) VAL [a={-1:0}, p={-1:0}, t={-2:0}] [L540] p->n = t [L541] EXPR p->n [L541] p = p->n [L536] COND FALSE !(__VERIFIER_nondet_int()) [L543] COND TRUE __VERIFIER_nondet_int() [L544] p->h = 2 [L545] t = (List) malloc(sizeof(struct node)) [L546] COND FALSE !(t == 0) VAL [a={-1:0}, p={-2:0}, t={-3:0}] [L547] p->n = t [L548] EXPR p->n [L548] p = p->n [L543] COND FALSE !(__VERIFIER_nondet_int()) [L550] p->h = 3 [L551] p = a VAL [p={-1:0}] [L552] EXPR p->h [L552] COND FALSE !(p->h == 2) [L554] EXPR p->h [L554] COND TRUE p->h == 1 [L555] EXPR p->n [L555] p = p->n VAL [p={-2:0}] [L554] EXPR p->h [L554] COND FALSE !(p->h == 1) [L556] EXPR p->h [L556] COND TRUE p->h != 3 [L557] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.8s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 313 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 313 mSDsluCounter, 1153 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 553 IncrementalHoareTripleChecker+Unchecked, 976 mSDsCounter, 137 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1762 IncrementalHoareTripleChecker+Invalid, 2452 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 137 mSolverCounterUnsat, 177 mSDtfsCounter, 1762 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 442 GetRequests, 229 SyntacticMatches, 4 SemanticMatches, 209 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=11, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 71 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 395 NumberOfCodeBlocks, 395 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 500 ConstructedInterpolants, 78 QuantifiedInterpolants, 8545 SizeOfPredicates, 42 NumberOfNonLiveVariables, 976 ConjunctsInSsa, 305 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 19/118 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-12 18:22:58,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE