./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 023d838f 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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:12:26,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:12:26,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:12:26,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:12:26,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:12:26,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:12:26,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:12:26,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:12:26,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:12:26,709 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:12:26,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:12:26,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:12:26,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:12:26,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:12:26,711 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:12:26,711 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:12:26,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:12:26,715 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:12:26,715 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:12:26,715 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:12:26,715 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:12:26,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:12:26,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:12:26,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:12:26,720 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:12:26,720 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:12:26,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:12:26,720 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:12:26,720 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:12:26,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:12:26,721 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:12:26,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:12:26,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:12:26,722 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:12:26,722 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:12:26,722 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:12:26,722 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:12:26,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:12:26,723 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:12:26,723 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:12:26,723 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:12:26,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:12:26,723 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-09 22:12:26,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:12:26,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:12:26,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:12:26,943 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:12:26,944 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:12:26,945 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-09 22:12:28,273 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:12:28,390 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:12:28,391 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/matrix-2-2.c [2024-11-09 22:12:28,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6353b6257/8b3fde6592f245acaebe6605f4a8e345/FLAG9f3f703c1 [2024-11-09 22:12:28,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6353b6257/8b3fde6592f245acaebe6605f4a8e345 [2024-11-09 22:12:28,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:12:28,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:12:28,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:12:28,413 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:12:28,417 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:12:28,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:12:28" (1/1) ... [2024-11-09 22:12:28,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ea13af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:28, skipping insertion in model container [2024-11-09 22:12:28,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:12:28" (1/1) ... [2024-11-09 22:12:28,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:12:28,550 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-09 22:12:28,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:12:28,574 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:12:28,582 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-09 22:12:28,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:12:28,601 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:12:28,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:28 WrapperNode [2024-11-09 22:12:28,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:12:28,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:12:28,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:12:28,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:12:28,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:28" (1/1) ... [2024-11-09 22:12:28,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:28" (1/1) ... [2024-11-09 22:12:28,625 INFO L138 Inliner]: procedures = 15, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2024-11-09 22:12:28,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:12:28,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:12:28,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:12:28,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:12:28,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:28" (1/1) ... [2024-11-09 22:12:28,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:28" (1/1) ... [2024-11-09 22:12:28,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:28" (1/1) ... [2024-11-09 22:12:28,645 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-09 22:12:28,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:28" (1/1) ... [2024-11-09 22:12:28,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:28" (1/1) ... [2024-11-09 22:12:28,648 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:28" (1/1) ... [2024-11-09 22:12:28,648 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:28" (1/1) ... [2024-11-09 22:12:28,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:28" (1/1) ... [2024-11-09 22:12:28,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:28" (1/1) ... [2024-11-09 22:12:28,651 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:12:28,652 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:12:28,652 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:12:28,652 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:12:28,652 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:28" (1/1) ... [2024-11-09 22:12:28,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:12:28,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:12:28,685 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-09 22:12:28,691 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-09 22:12:28,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:12:28,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:12:28,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 22:12:28,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 22:12:28,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 22:12:28,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 22:12:28,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:12:28,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:12:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 22:12:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 22:12:28,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 22:12:28,790 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:12:28,792 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:12:28,979 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-09 22:12:28,980 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:12:28,988 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:12:28,988 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:12:28,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:12:28 BoogieIcfgContainer [2024-11-09 22:12:28,988 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:12:28,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:12:28,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:12:28,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:12:28,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:12:28" (1/3) ... [2024-11-09 22:12:28,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ea05cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:12:28, skipping insertion in model container [2024-11-09 22:12:28,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:28" (2/3) ... [2024-11-09 22:12:28,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ea05cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:12:28, skipping insertion in model container [2024-11-09 22:12:28,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:12:28" (3/3) ... [2024-11-09 22:12:28,994 INFO L112 eAbstractionObserver]: Analyzing ICFG matrix-2-2.c [2024-11-09 22:12:29,009 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:12:29,010 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:12:29,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:12:29,070 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;@3d9342ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:12:29,070 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:12:29,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 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-09 22:12:29,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 22:12:29,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:12:29,077 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:12:29,078 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:12:29,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:12:29,081 INFO L85 PathProgramCache]: Analyzing trace with hash -557370034, now seen corresponding path program 1 times [2024-11-09 22:12:29,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:12:29,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654055421] [2024-11-09 22:12:29,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:12:29,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:12:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:12:29,217 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-09 22:12:29,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:12:29,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654055421] [2024-11-09 22:12:29,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654055421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:12:29,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:12:29,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 22:12:29,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555212301] [2024-11-09 22:12:29,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:12:29,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 22:12:29,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:12:29,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 22:12:29,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:12:29,248 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 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 6.0) internal successors, (12), 2 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-09 22:12:29,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:12:29,258 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2024-11-09 22:12:29,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 22:12:29,260 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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-09 22:12:29,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:12:29,265 INFO L225 Difference]: With dead ends: 48 [2024-11-09 22:12:29,265 INFO L226 Difference]: Without dead ends: 21 [2024-11-09 22:12:29,271 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-09 22:12:29,273 INFO L432 NwaCegarLoop]: 30 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, 30 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-09 22:12:29,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:12:29,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-09 22:12:29,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-09 22:12:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:12:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-11-09 22:12:29,298 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 12 [2024-11-09 22:12:29,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:12:29,298 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-11-09 22:12:29,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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-09 22:12:29,299 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-11-09 22:12:29,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 22:12:29,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:12:29,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:12:29,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:12:29,301 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:12:29,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:12:29,302 INFO L85 PathProgramCache]: Analyzing trace with hash 105670844, now seen corresponding path program 1 times [2024-11-09 22:12:29,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:12:29,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198380770] [2024-11-09 22:12:29,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:12:29,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:12:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:12:29,530 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-09 22:12:29,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:12:29,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198380770] [2024-11-09 22:12:29,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198380770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:12:29,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:12:29,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:12:29,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122230379] [2024-11-09 22:12:29,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:12:29,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:12:29,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:12:29,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:12:29,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:12:29,534 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:12:29,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:12:29,619 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2024-11-09 22:12:29,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:12:29,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 22:12:29,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:12:29,621 INFO L225 Difference]: With dead ends: 51 [2024-11-09 22:12:29,621 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 22:12:29,621 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-09 22:12:29,622 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 46 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-09 22:12:29,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 46 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:12:29,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 22:12:29,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 23. [2024-11-09 22:12:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-09 22:12:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-09 22:12:29,630 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2024-11-09 22:12:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:12:29,630 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-09 22:12:29,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:12:29,630 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-09 22:12:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 22:12:29,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:12:29,631 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:12:29,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:12:29,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:12:29,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:12:29,632 INFO L85 PathProgramCache]: Analyzing trace with hash 180030592, now seen corresponding path program 1 times [2024-11-09 22:12:29,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:12:29,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816895697] [2024-11-09 22:12:29,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:12:29,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:12:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:12:29,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:12:29,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:12:29,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816895697] [2024-11-09 22:12:29,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816895697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:12:29,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:12:29,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:12:29,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446137363] [2024-11-09 22:12:29,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:12:29,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:12:29,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:12:29,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:12:29,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:12:29,752 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:12:29,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:12:29,794 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2024-11-09 22:12:29,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:12:29,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 22:12:29,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:12:29,795 INFO L225 Difference]: With dead ends: 63 [2024-11-09 22:12:29,795 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 22:12:29,796 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-09 22:12:29,796 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 59 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.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:12:29,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 59 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:12:29,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 22:12:29,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2024-11-09 22:12:29,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 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-09 22:12:29,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-09 22:12:29,800 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 18 [2024-11-09 22:12:29,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:12:29,800 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-09 22:12:29,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:12:29,800 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-09 22:12:29,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 22:12:29,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:12:29,801 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:12:29,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 22:12:29,801 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:12:29,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:12:29,802 INFO L85 PathProgramCache]: Analyzing trace with hash -26188990, now seen corresponding path program 1 times [2024-11-09 22:12:29,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:12:29,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924316047] [2024-11-09 22:12:29,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:12:29,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:12:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:12:29,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2134173054] [2024-11-09 22:12:29,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:12:29,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:12:29,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:12:29,829 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-09 22:12:29,834 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-09 22:12:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 22:12:29,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 22:12:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 22:12:30,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 22:12:30,019 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 22:12:30,020 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 22:12:30,030 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-09 22:12:30,222 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-09 22:12:30,228 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 22:12:30,252 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 22:12:30,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:12:30 BoogieIcfgContainer [2024-11-09 22:12:30,257 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 22:12:30,257 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 22:12:30,257 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 22:12:30,258 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 22:12:30,258 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:12:28" (3/4) ... [2024-11-09 22:12:30,260 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 22:12:30,293 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 22:12:30,293 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 22:12:30,294 INFO L158 Benchmark]: Toolchain (without parser) took 1881.81ms. Allocated memory was 142.6MB in the beginning and 205.5MB in the end (delta: 62.9MB). Free memory was 73.9MB in the beginning and 128.3MB in the end (delta: -54.3MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2024-11-09 22:12:30,294 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 22:12:30,294 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.62ms. Allocated memory is still 142.6MB. Free memory was 73.7MB in the beginning and 61.0MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 22:12:30,294 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.79ms. Allocated memory is still 142.6MB. Free memory was 61.0MB in the beginning and 59.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:12:30,294 INFO L158 Benchmark]: Boogie Preprocessor took 24.93ms. Allocated memory is still 142.6MB. Free memory was 59.2MB in the beginning and 57.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:12:30,295 INFO L158 Benchmark]: IcfgBuilder took 336.77ms. Allocated memory was 142.6MB in the beginning and 205.5MB in the end (delta: 62.9MB). Free memory was 57.4MB in the beginning and 169.5MB in the end (delta: -112.1MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-11-09 22:12:30,295 INFO L158 Benchmark]: TraceAbstraction took 1266.88ms. Allocated memory is still 205.5MB. Free memory was 168.5MB in the beginning and 131.1MB in the end (delta: 37.3MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2024-11-09 22:12:30,295 INFO L158 Benchmark]: Witness Printer took 35.78ms. Allocated memory is still 205.5MB. Free memory was 130.4MB in the beginning and 128.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:12:30,296 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.15ms. Allocated memory is still 142.6MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.62ms. Allocated memory is still 142.6MB. Free memory was 73.7MB in the beginning and 61.0MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.79ms. Allocated memory is still 142.6MB. Free memory was 61.0MB in the beginning and 59.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.93ms. Allocated memory is still 142.6MB. Free memory was 59.2MB in the beginning and 57.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 336.77ms. Allocated memory was 142.6MB in the beginning and 205.5MB in the end (delta: 62.9MB). Free memory was 57.4MB in the beginning and 169.5MB in the end (delta: -112.1MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1266.88ms. Allocated memory is still 205.5MB. Free memory was 168.5MB in the beginning and 131.1MB in the end (delta: 37.3MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. * Witness Printer took 35.78ms. Allocated memory is still 205.5MB. Free memory was 130.4MB in the beginning and 128.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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=4294967297, 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=4294967297, j=0, k=0, maior=0, matriz={4:0}] [L26] k++ VAL [N_COL=1, N_LIN=4294967297, j=0, k=1, maior=0, matriz={4:0}] [L26] COND FALSE !(k