./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/condgf.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/condgf.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 f6e9c50b7debf63002c3de8c5fbbc063838f4d20677e88c6b86a62b1ad965f5f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:34:10,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:34:10,313 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:34:10,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:34:10,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:34:10,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:34:10,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:34:10,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:34:10,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:34:10,351 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:34:10,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:34:10,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:34:10,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:34:10,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:34:10,353 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:34:10,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:34:10,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:34:10,353 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:34:10,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:34:10,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:34:10,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:34:10,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:34:10,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:34:10,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:34:10,354 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:34:10,354 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:34:10,354 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:34:10,354 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:34:10,354 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:34:10,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:34:10,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:34:10,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:34:10,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:34:10,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:34:10,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:34:10,355 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:34:10,355 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:34:10,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:34:10,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:34:10,355 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:34:10,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:34:10,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:34:10,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:34:10,356 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> f6e9c50b7debf63002c3de8c5fbbc063838f4d20677e88c6b86a62b1ad965f5f [2025-03-03 09:34:10,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:34:10,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:34:10,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:34:10,613 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:34:10,614 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:34:10,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/condgf.c [2025-03-03 09:34:11,741 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/875399fbf/6a844add4baf4c3a81d811ada8dfde45/FLAG544dd52a0 [2025-03-03 09:34:11,945 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:34:11,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condgf.c [2025-03-03 09:34:11,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/875399fbf/6a844add4baf4c3a81d811ada8dfde45/FLAG544dd52a0 [2025-03-03 09:34:12,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/875399fbf/6a844add4baf4c3a81d811ada8dfde45 [2025-03-03 09:34:12,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:34:12,308 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:34:12,309 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:34:12,309 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:34:12,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:34:12,313 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:34:12" (1/1) ... [2025-03-03 09:34:12,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f5808d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:12, skipping insertion in model container [2025-03-03 09:34:12,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:34:12" (1/1) ... [2025-03-03 09:34:12,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:34:12,407 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condgf.c[589,602] [2025-03-03 09:34:12,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:34:12,424 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:34:12,430 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condgf.c[589,602] [2025-03-03 09:34:12,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:34:12,443 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:34:12,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:12 WrapperNode [2025-03-03 09:34:12,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:34:12,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:34:12,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:34:12,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:34:12,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:12" (1/1) ... [2025-03-03 09:34:12,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:12" (1/1) ... [2025-03-03 09:34:12,467 INFO L138 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2025-03-03 09:34:12,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:34:12,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:34:12,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:34:12,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:34:12,472 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:12" (1/1) ... [2025-03-03 09:34:12,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:12" (1/1) ... [2025-03-03 09:34:12,473 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:12" (1/1) ... [2025-03-03 09:34:12,481 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 4, 7]. 54 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 5 writes are split as follows [0, 2, 3]. [2025-03-03 09:34:12,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:12" (1/1) ... [2025-03-03 09:34:12,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:12" (1/1) ... [2025-03-03 09:34:12,485 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:12" (1/1) ... [2025-03-03 09:34:12,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:12" (1/1) ... [2025-03-03 09:34:12,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:12" (1/1) ... [2025-03-03 09:34:12,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:12" (1/1) ... [2025-03-03 09:34:12,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:34:12,488 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:34:12,489 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:34:12,489 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:34:12,489 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:12" (1/1) ... [2025-03-03 09:34:12,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:34:12,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:34:12,510 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) [2025-03-03 09:34:12,512 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 [2025-03-03 09:34:12,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:34:12,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:34:12,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:34:12,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 09:34:12,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:34:12,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:34:12,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:34:12,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 09:34:12,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 09:34:12,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:34:12,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:34:12,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:34:12,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:34:12,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 09:34:12,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:34:12,583 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:34:12,585 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:34:12,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#sum~0#1.base, main_~#sum~0#1.offset);havoc main_~#sum~0#1.base, main_~#sum~0#1.offset; [2025-03-03 09:34:12,733 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-03 09:34:12,734 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:34:12,741 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:34:12,741 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:34:12,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:34:12 BoogieIcfgContainer [2025-03-03 09:34:12,741 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:34:12,744 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:34:12,745 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:34:12,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:34:12,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:34:12" (1/3) ... [2025-03-03 09:34:12,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2afff301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:34:12, skipping insertion in model container [2025-03-03 09:34:12,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:12" (2/3) ... [2025-03-03 09:34:12,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2afff301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:34:12, skipping insertion in model container [2025-03-03 09:34:12,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:34:12" (3/3) ... [2025-03-03 09:34:12,751 INFO L128 eAbstractionObserver]: Analyzing ICFG condgf.c [2025-03-03 09:34:12,764 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:34:12,766 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG condgf.c that has 1 procedures, 18 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-03 09:34:12,807 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:34:12,819 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;@4dd43b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:34:12,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:34:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 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) [2025-03-03 09:34:12,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 09:34:12,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:34:12,829 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:34:12,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:34:12,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:34:12,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1274003349, now seen corresponding path program 1 times [2025-03-03 09:34:12,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:34:12,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314539428] [2025-03-03 09:34:12,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:34:12,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:34:12,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 09:34:12,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 09:34:12,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:34:12,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:34:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:34:12,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:34:12,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314539428] [2025-03-03 09:34:12,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314539428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:34:12,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:34:12,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:34:12,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589155504] [2025-03-03 09:34:12,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:34:12,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 09:34:12,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:34:12,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 09:34:12,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:34:12,983 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 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) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:12,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:34:12,992 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2025-03-03 09:34:12,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 09:34:12,993 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-03 09:34:12,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:34:12,998 INFO L225 Difference]: With dead ends: 32 [2025-03-03 09:34:12,998 INFO L226 Difference]: Without dead ends: 15 [2025-03-03 09:34:13,000 INFO L434 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 [2025-03-03 09:34:13,001 INFO L435 NwaCegarLoop]: 23 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, 23 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 [2025-03-03 09:34:13,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:34:13,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-03 09:34:13,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-03 09:34:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:13,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2025-03-03 09:34:13,023 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 11 [2025-03-03 09:34:13,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:34:13,023 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-03 09:34:13,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:13,024 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2025-03-03 09:34:13,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 09:34:13,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:34:13,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:34:13,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:34:13,025 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:34:13,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:34:13,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1278153612, now seen corresponding path program 1 times [2025-03-03 09:34:13,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:34:13,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250795728] [2025-03-03 09:34:13,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:34:13,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:34:13,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 09:34:13,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 09:34:13,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:34:13,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:34:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:34:13,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:34:13,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250795728] [2025-03-03 09:34:13,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250795728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:34:13,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:34:13,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:34:13,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976623272] [2025-03-03 09:34:13,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:34:13,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:34:13,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:34:13,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:34:13,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:34:13,154 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:13,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:34:13,217 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2025-03-03 09:34:13,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:34:13,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-03 09:34:13,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:34:13,218 INFO L225 Difference]: With dead ends: 34 [2025-03-03 09:34:13,218 INFO L226 Difference]: Without dead ends: 25 [2025-03-03 09:34:13,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:34:13,219 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 32 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:34:13,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 11 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:34:13,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-03 09:34:13,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2025-03-03 09:34:13,225 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) [2025-03-03 09:34:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-03 09:34:13,227 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2025-03-03 09:34:13,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:34:13,227 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-03 09:34:13,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-03 09:34:13,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 09:34:13,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:34:13,228 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:34:13,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:34:13,228 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:34:13,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:34:13,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1890165835, now seen corresponding path program 1 times [2025-03-03 09:34:13,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:34:13,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910067403] [2025-03-03 09:34:13,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:34:13,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:34:13,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 09:34:13,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:34:13,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:34:13,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:34:13,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:34:13,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:34:13,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910067403] [2025-03-03 09:34:13,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910067403] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:34:13,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540801813] [2025-03-03 09:34:13,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:34:13,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:34:13,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:34:13,728 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) [2025-03-03 09:34:13,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:34:13,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 09:34:13,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:34:13,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:34:13,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:34:13,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 09:34:13,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:34:13,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:34:13,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:34:13,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-03 09:34:13,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 09:34:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:34:14,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:34:14,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-03 09:34:14,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2025-03-03 09:34:14,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:34:14,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540801813] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:34:14,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:34:14,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-03 09:34:14,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089095174] [2025-03-03 09:34:14,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:34:14,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 09:34:14,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:34:14,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 09:34:14,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:34:14,111 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 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) [2025-03-03 09:34:14,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:34:14,371 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2025-03-03 09:34:14,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:34:14,371 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 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 16 [2025-03-03 09:34:14,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:34:14,372 INFO L225 Difference]: With dead ends: 45 [2025-03-03 09:34:14,372 INFO L226 Difference]: Without dead ends: 37 [2025-03-03 09:34:14,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2025-03-03 09:34:14,373 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 54 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:34:14,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 57 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:34:14,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-03 09:34:14,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2025-03-03 09:34:14,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:14,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2025-03-03 09:34:14,376 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 16 [2025-03-03 09:34:14,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:34:14,376 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2025-03-03 09:34:14,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 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) [2025-03-03 09:34:14,376 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2025-03-03 09:34:14,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 09:34:14,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:34:14,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:34:14,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 09:34:14,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:34:14,581 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:34:14,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:34:14,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1861536684, now seen corresponding path program 1 times [2025-03-03 09:34:14,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:34:14,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739338056] [2025-03-03 09:34:14,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:34:14,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:34:14,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 09:34:14,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:34:14,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:34:14,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 09:34:14,603 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 09:34:14,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 09:34:14,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:34:14,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:34:14,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 09:34:14,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 09:34:14,619 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 09:34:14,619 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 09:34:14,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:34:14,622 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-03 09:34:14,634 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 09:34:14,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:34:14 BoogieIcfgContainer [2025-03-03 09:34:14,635 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 09:34:14,636 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 09:34:14,636 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 09:34:14,636 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 09:34:14,637 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:34:12" (3/4) ... [2025-03-03 09:34:14,637 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 09:34:14,664 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 15. [2025-03-03 09:34:14,704 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 09:34:14,705 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 09:34:14,705 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 09:34:14,705 INFO L158 Benchmark]: Toolchain (without parser) took 2397.11ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 54.9MB in the end (delta: 50.0MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. [2025-03-03 09:34:14,706 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:34:14,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 135.01ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 93.9MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:34:14,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.92ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:34:14,707 INFO L158 Benchmark]: Boogie Preprocessor took 20.05ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 91.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:34:14,707 INFO L158 Benchmark]: IcfgBuilder took 252.64ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 78.3MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:34:14,707 INFO L158 Benchmark]: TraceAbstraction took 1891.33ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 60.7MB in the end (delta: 17.6MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2025-03-03 09:34:14,707 INFO L158 Benchmark]: Witness Printer took 69.02ms. Allocated memory is still 142.6MB. Free memory was 60.7MB in the beginning and 54.9MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:34:14,708 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.20ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 135.01ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 93.9MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.92ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.05ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 91.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 252.64ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 78.3MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1891.33ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 60.7MB in the end (delta: 17.6MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Witness Printer took 69.02ms. Allocated memory is still 142.6MB. Free memory was 60.7MB in the beginning and 54.9MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. 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: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int N; VAL [N=0] [L23] N = __VERIFIER_nondet_int() [L24] COND FALSE !(N <= 0) [L25] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) [L13] COND FALSE !(!cond) VAL [N=1] [L25] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) [L27] int i; [L28] long long sum[1]; [L29] int *a = malloc(sizeof(int)*N); [L31] sum[0] = 0 [L32] i=0 VAL [N=1, a={-1:0}, i=0, sum={5:0}] [L32] COND TRUE i