./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/matrix-2-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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/loops/matrix-2-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 29c60028fe77c919c85938e022adc26e4c09a5802df35e9dae1aea434a543980 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 23:49:08,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 23:49:08,441 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 23:49:08,446 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 23:49:08,448 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 23:49:08,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 23:49:08,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 23:49:08,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 23:49:08,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 23:49:08,465 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 23:49:08,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 23:49:08,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 23:49:08,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 23:49:08,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 23:49:08,467 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 23:49:08,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 23:49:08,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 23:49:08,471 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 23:49:08,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 23:49:08,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 23:49:08,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 23:49:08,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 23:49:08,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 23:49:08,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 23:49:08,476 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 23:49:08,476 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 23:49:08,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 23:49:08,477 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 23:49:08,477 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 23:49:08,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 23:49:08,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 23:49:08,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 23:49:08,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 23:49:08,478 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 23:49:08,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 23:49:08,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 23:49:08,478 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 23:49:08,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 23:49:08,479 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 23:49:08,479 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 23:49:08,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 23:49:08,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 23:49:08,480 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 -> 29c60028fe77c919c85938e022adc26e4c09a5802df35e9dae1aea434a543980 [2024-10-23 23:49:08,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 23:49:08,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 23:49:08,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 23:49:08,719 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 23:49:08,721 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 23:49:08,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/matrix-2-2.c [2024-10-23 23:49:09,965 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 23:49:10,111 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 23:49:10,112 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/matrix-2-2.c [2024-10-23 23:49:10,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c833fe89/480ebafbcbcc4f60a3d0d3d1c6b0e59b/FLAG67a012750 [2024-10-23 23:49:10,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c833fe89/480ebafbcbcc4f60a3d0d3d1c6b0e59b [2024-10-23 23:49:10,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 23:49:10,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 23:49:10,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 23:49:10,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 23:49:10,136 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 23:49:10,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 11:49:10" (1/1) ... [2024-10-23 23:49:10,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a914bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:49:10, skipping insertion in model container [2024-10-23 23:49:10,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 11:49:10" (1/1) ... [2024-10-23 23:49:10,151 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 23:49:10,261 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/loops/matrix-2-2.c[322,335] [2024-10-23 23:49:10,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 23:49:10,280 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 23:49:10,289 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/loops/matrix-2-2.c[322,335] [2024-10-23 23:49:10,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 23:49:10,312 INFO L204 MainTranslator]: Completed translation [2024-10-23 23:49:10,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:49:10 WrapperNode [2024-10-23 23:49:10,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 23:49:10,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 23:49:10,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 23:49:10,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 23:49:10,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:49:10" (1/1) ... [2024-10-23 23:49:10,323 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:49:10" (1/1) ... [2024-10-23 23:49:10,338 INFO L138 Inliner]: procedures = 15, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2024-10-23 23:49:10,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 23:49:10,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 23:49:10,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 23:49:10,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 23:49:10,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:49:10" (1/1) ... [2024-10-23 23:49:10,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:49:10" (1/1) ... [2024-10-23 23:49:10,349 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:49:10" (1/1) ... [2024-10-23 23:49:10,357 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-10-23 23:49:10,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:49:10" (1/1) ... [2024-10-23 23:49:10,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:49:10" (1/1) ... [2024-10-23 23:49:10,361 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:49:10" (1/1) ... [2024-10-23 23:49:10,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:49:10" (1/1) ... [2024-10-23 23:49:10,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:49:10" (1/1) ... [2024-10-23 23:49:10,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:49:10" (1/1) ... [2024-10-23 23:49:10,365 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 23:49:10,369 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 23:49:10,369 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 23:49:10,369 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 23:49:10,370 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:49:10" (1/1) ... [2024-10-23 23:49:10,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 23:49:10,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:49:10,394 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-23 23:49:10,398 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-23 23:49:10,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 23:49:10,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 23:49:10,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-23 23:49:10,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-23 23:49:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-23 23:49:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-23 23:49:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 23:49:10,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 23:49:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-23 23:49:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-23 23:49:10,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-23 23:49:10,482 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 23:49:10,484 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 23:49:10,596 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-23 23:49:10,599 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 23:49:10,613 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 23:49:10,614 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-23 23:49:10,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 11:49:10 BoogieIcfgContainer [2024-10-23 23:49:10,614 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 23:49:10,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 23:49:10,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 23:49:10,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 23:49:10,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 11:49:10" (1/3) ... [2024-10-23 23:49:10,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41df3e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 11:49:10, skipping insertion in model container [2024-10-23 23:49:10,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:49:10" (2/3) ... [2024-10-23 23:49:10,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41df3e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 11:49:10, skipping insertion in model container [2024-10-23 23:49:10,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 11:49:10" (3/3) ... [2024-10-23 23:49:10,621 INFO L112 eAbstractionObserver]: Analyzing ICFG matrix-2-2.c [2024-10-23 23:49:10,632 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 23:49:10,633 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 23:49:10,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 23:49:10,694 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;@3f8c59f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 23:49:10,694 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 23:49:10,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.75) internal successors, (28), 17 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-23 23:49:10,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-23 23:49:10,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:49:10,701 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:49:10,701 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:49:10,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:49:10,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1131822620, now seen corresponding path program 1 times [2024-10-23 23:49:10,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:49:10,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239686851] [2024-10-23 23:49:10,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:49:10,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:49:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:49:10,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-23 23:49:10,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:49:10,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239686851] [2024-10-23 23:49:10,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239686851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:49:10,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:49:10,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 23:49:10,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752825893] [2024-10-23 23:49:10,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:49:10,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 23:49:10,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:49:10,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 23:49:10,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 23:49:10,892 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.75) internal successors, (28), 17 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) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-23 23:49:10,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:49:10,911 INFO L93 Difference]: Finished difference Result 34 states and 53 transitions. [2024-10-23 23:49:10,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 23:49:10,913 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2024-10-23 23:49:10,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:49:10,919 INFO L225 Difference]: With dead ends: 34 [2024-10-23 23:49:10,919 INFO L226 Difference]: Without dead ends: 15 [2024-10-23 23:49:10,921 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-23 23:49:10,925 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 23:49:10,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 23:49:10,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-23 23:49:10,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-23 23:49:10,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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-23 23:49:10,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2024-10-23 23:49:10,945 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 8 [2024-10-23 23:49:10,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:49:10,945 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-10-23 23:49:10,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-23 23:49:10,946 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2024-10-23 23:49:10,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-23 23:49:10,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:49:10,946 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:49:10,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 23:49:10,947 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:49:10,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:49:10,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1790293093, now seen corresponding path program 1 times [2024-10-23 23:49:10,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:49:10,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122326709] [2024-10-23 23:49:10,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:49:10,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:49:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:49:11,155 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-23 23:49:11,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:49:11,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122326709] [2024-10-23 23:49:11,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122326709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:49:11,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:49:11,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 23:49:11,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806895663] [2024-10-23 23:49:11,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:49:11,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 23:49:11,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:49:11,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 23:49:11,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-23 23:49:11,158 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-23 23:49:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:49:11,203 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-10-23 23:49:11,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 23:49:11,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2024-10-23 23:49:11,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:49:11,204 INFO L225 Difference]: With dead ends: 36 [2024-10-23 23:49:11,204 INFO L226 Difference]: Without dead ends: 27 [2024-10-23 23:49:11,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-23 23:49:11,205 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 23:49:11,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 31 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 23:49:11,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-23 23:49:11,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 16. [2024-10-23 23:49:11,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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-23 23:49:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-10-23 23:49:11,209 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 8 [2024-10-23 23:49:11,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:49:11,209 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-23 23:49:11,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-23 23:49:11,209 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2024-10-23 23:49:11,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-23 23:49:11,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:49:11,210 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:49:11,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 23:49:11,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:49:11,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:49:11,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1852383321, now seen corresponding path program 1 times [2024-10-23 23:49:11,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:49:11,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285551777] [2024-10-23 23:49:11,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:49:11,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:49:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:49:11,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 23:49:11,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:49:11,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285551777] [2024-10-23 23:49:11,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285551777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:49:11,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:49:11,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 23:49:11,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578282842] [2024-10-23 23:49:11,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:49:11,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 23:49:11,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:49:11,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 23:49:11,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-23 23:49:11,397 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-23 23:49:11,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:49:11,453 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2024-10-23 23:49:11,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 23:49:11,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-23 23:49:11,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:49:11,455 INFO L225 Difference]: With dead ends: 44 [2024-10-23 23:49:11,455 INFO L226 Difference]: Without dead ends: 24 [2024-10-23 23:49:11,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-23 23:49:11,456 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 23:49:11,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 30 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 23:49:11,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-23 23:49:11,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2024-10-23 23:49:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 23:49:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-10-23 23:49:11,462 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2024-10-23 23:49:11,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:49:11,463 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-10-23 23:49:11,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-23 23:49:11,463 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-10-23 23:49:11,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-23 23:49:11,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:49:11,464 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:49:11,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 23:49:11,465 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:49:11,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:49:11,466 INFO L85 PathProgramCache]: Analyzing trace with hash 479698356, now seen corresponding path program 1 times [2024-10-23 23:49:11,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:49:11,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800487962] [2024-10-23 23:49:11,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:49:11,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:49:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-23 23:49:11,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [810645981] [2024-10-23 23:49:11,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:49:11,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:49:11,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:49:11,505 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-23 23:49:11,508 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-23 23:49:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-23 23:49:11,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-23 23:49:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-23 23:49:11,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-23 23:49:11,642 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-23 23:49:11,642 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 23:49:11,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-23 23:49:11,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:49:11,850 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-23 23:49:11,873 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 23:49:11,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 11:49:11 BoogieIcfgContainer [2024-10-23 23:49:11,877 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 23:49:11,877 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 23:49:11,877 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 23:49:11,877 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 23:49:11,878 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 11:49:10" (3/4) ... [2024-10-23 23:49:11,878 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-23 23:49:11,915 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 23:49:11,915 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 23:49:11,915 INFO L158 Benchmark]: Toolchain (without parser) took 1784.57ms. Allocated memory is still 184.5MB. Free memory was 116.2MB in the beginning and 81.8MB in the end (delta: 34.5MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2024-10-23 23:49:11,916 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 23:49:11,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.37ms. Allocated memory is still 184.5MB. Free memory was 115.9MB in the beginning and 103.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-23 23:49:11,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.32ms. Allocated memory is still 184.5MB. Free memory was 103.6MB in the beginning and 101.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 23:49:11,916 INFO L158 Benchmark]: Boogie Preprocessor took 26.69ms. Allocated memory is still 184.5MB. Free memory was 101.8MB in the beginning and 99.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-23 23:49:11,916 INFO L158 Benchmark]: RCFGBuilder took 245.01ms. Allocated memory is still 184.5MB. Free memory was 99.7MB in the beginning and 85.8MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-23 23:49:11,917 INFO L158 Benchmark]: TraceAbstraction took 1260.81ms. Allocated memory is still 184.5MB. Free memory was 85.0MB in the beginning and 83.9MB in the end (delta: 1.2MB). Peak memory consumption was 1.3MB. Max. memory is 16.1GB. [2024-10-23 23:49:11,917 INFO L158 Benchmark]: Witness Printer took 38.03ms. Allocated memory is still 184.5MB. Free memory was 83.9MB in the beginning and 81.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-23 23:49:11,918 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.14ms. Allocated memory is still 184.5MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.37ms. Allocated memory is still 184.5MB. Free memory was 115.9MB in the beginning and 103.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.32ms. Allocated memory is still 184.5MB. Free memory was 103.6MB in the beginning and 101.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.69ms. Allocated memory is still 184.5MB. Free memory was 101.8MB in the beginning and 99.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 245.01ms. Allocated memory is still 184.5MB. Free memory was 99.7MB in the beginning and 85.8MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1260.81ms. Allocated memory is still 184.5MB. Free memory was 85.0MB in the beginning and 83.9MB in the end (delta: 1.2MB). Peak memory consumption was 1.3MB. Max. memory is 16.1GB. * Witness Printer took 38.03ms. Allocated memory is still 184.5MB. Free memory was 83.9MB in the beginning and 81.8MB 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: 7]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] unsigned int N_LIN=__VERIFIER_nondet_uint(); [L17] unsigned int N_COL=__VERIFIER_nondet_uint(); [L18] COND FALSE !(N_LIN >= 4000000000 / sizeof(int) || N_COL >= 4000000000 / sizeof(int)) [L21] unsigned int j,k; [L22] int matriz[N_COL][N_LIN], maior; [L24] maior = __VERIFIER_nondet_int() [L25] j=0 VAL [N_COL=1, N_LIN=1, j=0, maior=-1, matriz={4:0}] [L25] COND TRUE jmaior [L31] EXPR matriz[j][k] [L31] maior = matriz[j][k] VAL [N_COL=1, N_LIN=1, j=0, k=0, maior=0, matriz={4:0}] [L26] k++ VAL [N_COL=1, N_LIN=1, j=0, k=1, maior=0, matriz={4:0}] [L26] COND FALSE !(k