./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/matrix-2-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-c7c6ca5-m [2024-11-08 14:02:21,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 14:02:21,086 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 14:02:21,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 14:02:21,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 14:02:21,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 14:02:21,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 14:02:21,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 14:02:21,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 14:02:21,128 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 14:02:21,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 14:02:21,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 14:02:21,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 14:02:21,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 14:02:21,130 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 14:02:21,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 14:02:21,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 14:02:21,132 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 14:02:21,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 14:02:21,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 14:02:21,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 14:02:21,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 14:02:21,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 14:02:21,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 14:02:21,134 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 14:02:21,134 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 14:02:21,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 14:02:21,137 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 14:02:21,137 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 14:02:21,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 14:02:21,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 14:02:21,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 14:02:21,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:02:21,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 14:02:21,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 14:02:21,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 14:02:21,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 14:02:21,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 14:02:21,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 14:02:21,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 14:02:21,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 14:02:21,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 14:02:21,141 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-11-08 14:02:21,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 14:02:21,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 14:02:21,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 14:02:21,407 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 14:02:21,408 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 14:02:21,410 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/matrix-2-2.c [2024-11-08 14:02:22,915 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 14:02:23,108 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 14:02:23,109 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/matrix-2-2.c [2024-11-08 14:02:23,119 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4032a23/84a033871f504fc6bea6e921323c242c/FLAG411bb7d13 [2024-11-08 14:02:23,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c4032a23/84a033871f504fc6bea6e921323c242c [2024-11-08 14:02:23,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 14:02:23,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 14:02:23,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 14:02:23,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 14:02:23,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 14:02:23,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:02:23" (1/1) ... [2024-11-08 14:02:23,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6132a438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:02:23, skipping insertion in model container [2024-11-08 14:02:23,520 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:02:23" (1/1) ... [2024-11-08 14:02:23,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 14:02:23,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/matrix-2-2.c[322,335] [2024-11-08 14:02:23,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:02:23,772 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 14:02:23,781 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/matrix-2-2.c[322,335] [2024-11-08 14:02:23,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:02:23,805 INFO L204 MainTranslator]: Completed translation [2024-11-08 14:02:23,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:02:23 WrapperNode [2024-11-08 14:02:23,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 14:02:23,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 14:02:23,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 14:02:23,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 14:02:23,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:02:23" (1/1) ... [2024-11-08 14:02:23,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:02:23" (1/1) ... [2024-11-08 14:02:23,841 INFO L138 Inliner]: procedures = 15, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2024-11-08 14:02:23,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 14:02:23,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 14:02:23,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 14:02:23,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 14:02:23,853 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:02:23" (1/1) ... [2024-11-08 14:02:23,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:02:23" (1/1) ... [2024-11-08 14:02:23,855 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:02:23" (1/1) ... [2024-11-08 14:02:23,867 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-11-08 14:02:23,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:02:23" (1/1) ... [2024-11-08 14:02:23,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:02:23" (1/1) ... [2024-11-08 14:02:23,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:02:23" (1/1) ... [2024-11-08 14:02:23,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:02:23" (1/1) ... [2024-11-08 14:02:23,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:02:23" (1/1) ... [2024-11-08 14:02:23,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:02:23" (1/1) ... [2024-11-08 14:02:23,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 14:02:23,882 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 14:02:23,882 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 14:02:23,883 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 14:02:23,883 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:02:23" (1/1) ... [2024-11-08 14:02:23,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:02:23,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:02:23,923 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 14:02:23,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 14:02:23,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 14:02:23,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 14:02:23,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 14:02:23,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 14:02:23,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 14:02:23,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 14:02:23,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 14:02:23,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 14:02:23,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 14:02:23,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 14:02:23,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 14:02:24,063 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 14:02:24,066 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 14:02:24,240 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 14:02:24,240 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 14:02:24,251 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 14:02:24,252 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-08 14:02:24,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:02:24 BoogieIcfgContainer [2024-11-08 14:02:24,252 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 14:02:24,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 14:02:24,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 14:02:24,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 14:02:24,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 02:02:23" (1/3) ... [2024-11-08 14:02:24,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74aab418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:02:24, skipping insertion in model container [2024-11-08 14:02:24,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:02:23" (2/3) ... [2024-11-08 14:02:24,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74aab418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:02:24, skipping insertion in model container [2024-11-08 14:02:24,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:02:24" (3/3) ... [2024-11-08 14:02:24,264 INFO L112 eAbstractionObserver]: Analyzing ICFG matrix-2-2.c [2024-11-08 14:02:24,278 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 14:02:24,279 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 14:02:24,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 14:02:24,332 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;@6784da2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 14:02:24,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 14:02:24,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:02:24,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 14:02:24,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:02:24,341 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:02:24,341 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:02:24,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:02:24,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1978865680, now seen corresponding path program 1 times [2024-11-08 14:02:24,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:02:24,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440742129] [2024-11-08 14:02:24,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:02:24,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:02:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:02:24,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:02:24,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:02:24,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440742129] [2024-11-08 14:02:24,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440742129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:02:24,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:02:24,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 14:02:24,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308599587] [2024-11-08 14:02:24,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:02:24,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 14:02:24,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:02:24,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 14:02:24,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 14:02:24,542 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:02:24,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:02:24,557 INFO L93 Difference]: Finished difference Result 39 states and 58 transitions. [2024-11-08 14:02:24,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 14:02:24,560 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-08 14:02:24,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:02:24,567 INFO L225 Difference]: With dead ends: 39 [2024-11-08 14:02:24,568 INFO L226 Difference]: Without dead ends: 17 [2024-11-08 14:02:24,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 14:02:24,576 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:02:24,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:02:24,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-08 14:02:24,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-08 14:02:24,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:02:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-11-08 14:02:24,612 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2024-11-08 14:02:24,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:02:24,612 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-08 14:02:24,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:02:24,613 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-11-08 14:02:24,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 14:02:24,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:02:24,614 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:02:24,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 14:02:24,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:02:24,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:02:24,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1320395207, now seen corresponding path program 1 times [2024-11-08 14:02:24,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:02:24,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374581225] [2024-11-08 14:02:24,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:02:24,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:02:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:02:24,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:02:24,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:02:24,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374581225] [2024-11-08 14:02:24,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374581225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:02:24,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:02:24,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 14:02:24,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229707751] [2024-11-08 14:02:24,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:02:24,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 14:02:24,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:02:24,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 14:02:24,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 14:02:24,975 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:02:25,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:02:25,044 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2024-11-08 14:02:25,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 14:02:25,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-08 14:02:25,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:02:25,045 INFO L225 Difference]: With dead ends: 40 [2024-11-08 14:02:25,045 INFO L226 Difference]: Without dead ends: 30 [2024-11-08 14:02:25,046 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-11-08 14:02:25,047 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:02:25,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 34 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:02:25,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-08 14:02:25,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2024-11-08 14:02:25,053 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-11-08 14:02:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-08 14:02:25,053 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 9 [2024-11-08 14:02:25,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:02:25,054 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-08 14:02:25,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:02:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-08 14:02:25,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 14:02:25,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:02:25,055 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:02:25,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 14:02:25,055 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:02:25,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:02:25,056 INFO L85 PathProgramCache]: Analyzing trace with hash 448383483, now seen corresponding path program 1 times [2024-11-08 14:02:25,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:02:25,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276969191] [2024-11-08 14:02:25,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:02:25,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:02:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:02:25,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:02:25,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:02:25,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276969191] [2024-11-08 14:02:25,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276969191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:02:25,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:02:25,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 14:02:25,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560361011] [2024-11-08 14:02:25,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:02:25,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 14:02:25,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:02:25,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 14:02:25,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 14:02:25,254 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:02:25,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:02:25,334 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2024-11-08 14:02:25,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 14:02:25,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-08 14:02:25,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:02:25,336 INFO L225 Difference]: With dead ends: 48 [2024-11-08 14:02:25,337 INFO L226 Difference]: Without dead ends: 27 [2024-11-08 14:02:25,337 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-11-08 14:02:25,338 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:02:25,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 42 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:02:25,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-08 14:02:25,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2024-11-08 14:02:25,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:02:25,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-08 14:02:25,349 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2024-11-08 14:02:25,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:02:25,349 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-08 14:02:25,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:02:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-08 14:02:25,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 14:02:25,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:02:25,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:02:25,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 14:02:25,350 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:02:25,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:02:25,351 INFO L85 PathProgramCache]: Analyzing trace with hash -759520544, now seen corresponding path program 1 times [2024-11-08 14:02:25,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:02:25,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843320904] [2024-11-08 14:02:25,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:02:25,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:02:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:02:25,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1611971866] [2024-11-08 14:02:25,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:02:25,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:02:25,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:02:25,413 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:02:25,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 14:02:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 14:02:25,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 14:02:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 14:02:25,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 14:02:25,611 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 14:02:25,612 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 14:02:25,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 14:02:25,814 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-11-08 14:02:25,818 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 14:02:25,844 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 14:02:25,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 02:02:25 BoogieIcfgContainer [2024-11-08 14:02:25,847 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 14:02:25,848 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 14:02:25,848 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 14:02:25,848 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 14:02:25,849 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:02:24" (3/4) ... [2024-11-08 14:02:25,850 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 14:02:25,891 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 14:02:25,893 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 14:02:25,894 INFO L158 Benchmark]: Toolchain (without parser) took 2383.44ms. Allocated memory is still 172.0MB. Free memory was 103.1MB in the beginning and 137.2MB in the end (delta: -34.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 14:02:25,894 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 104.9MB. Free memory is still 66.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 14:02:25,894 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.68ms. Allocated memory is still 172.0MB. Free memory was 103.0MB in the beginning and 141.7MB in the end (delta: -38.7MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-08 14:02:25,894 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.54ms. Allocated memory is still 172.0MB. Free memory was 141.7MB in the beginning and 140.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 14:02:25,895 INFO L158 Benchmark]: Boogie Preprocessor took 39.68ms. Allocated memory is still 172.0MB. Free memory was 140.4MB in the beginning and 138.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 14:02:25,895 INFO L158 Benchmark]: RCFGBuilder took 369.90ms. Allocated memory is still 172.0MB. Free memory was 138.3MB in the beginning and 124.3MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 14:02:25,895 INFO L158 Benchmark]: TraceAbstraction took 1593.00ms. Allocated memory is still 172.0MB. Free memory was 123.7MB in the beginning and 139.9MB in the end (delta: -16.3MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. [2024-11-08 14:02:25,895 INFO L158 Benchmark]: Witness Printer took 45.30ms. Allocated memory is still 172.0MB. Free memory was 139.9MB in the beginning and 137.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 14:02:25,897 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.23ms. Allocated memory is still 104.9MB. Free memory is still 66.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.68ms. Allocated memory is still 172.0MB. Free memory was 103.0MB in the beginning and 141.7MB in the end (delta: -38.7MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.54ms. Allocated memory is still 172.0MB. Free memory was 141.7MB in the beginning and 140.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.68ms. Allocated memory is still 172.0MB. Free memory was 140.4MB in the beginning and 138.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 369.90ms. Allocated memory is still 172.0MB. Free memory was 138.3MB in the beginning and 124.3MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1593.00ms. Allocated memory is still 172.0MB. Free memory was 123.7MB in the beginning and 139.9MB in the end (delta: -16.3MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. * Witness Printer took 45.30ms. Allocated memory is still 172.0MB. Free memory was 139.9MB in the beginning and 137.2MB in the end (delta: 2.7MB). 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