./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs2f.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs2f.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 f5f17f058e96bd5c46baa242826f383c90eaddfa4dbca636ab924160b7cdb4ab --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 17:03:46,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 17:03:46,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 17:03:46,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 17:03:46,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 17:03:46,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 17:03:46,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 17:03:46,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 17:03:46,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 17:03:46,978 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 17:03:46,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 17:03:46,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 17:03:46,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 17:03:46,979 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 17:03:46,979 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 17:03:46,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 17:03:46,980 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 17:03:46,980 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 17:03:46,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 17:03:46,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 17:03:46,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 17:03:46,981 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 17:03:46,981 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 17:03:46,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 17:03:46,982 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 17:03:46,982 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 17:03:46,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 17:03:46,983 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 17:03:46,983 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 17:03:46,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 17:03:46,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 17:03:46,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 17:03:46,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 17:03:46,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 17:03:46,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 17:03:46,985 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 17:03:46,985 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 17:03:46,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 17:03:46,985 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 17:03:46,986 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 17:03:46,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 17:03:46,986 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 17:03:46,986 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 -> f5f17f058e96bd5c46baa242826f383c90eaddfa4dbca636ab924160b7cdb4ab [2024-11-19 17:03:47,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 17:03:47,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 17:03:47,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 17:03:47,263 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 17:03:47,264 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 17:03:47,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs2f.c [2024-11-19 17:03:48,649 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 17:03:48,796 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 17:03:48,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs2f.c [2024-11-19 17:03:48,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de40ccf85/fd20ef744a644413a68bc8db8bf08b05/FLAG716363f6b [2024-11-19 17:03:49,214 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de40ccf85/fd20ef744a644413a68bc8db8bf08b05 [2024-11-19 17:03:49,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 17:03:49,218 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 17:03:49,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 17:03:49,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 17:03:49,227 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 17:03:49,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:03:49" (1/1) ... [2024-11-19 17:03:49,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@736e807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:49, skipping insertion in model container [2024-11-19 17:03:49,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:03:49" (1/1) ... [2024-11-19 17:03:49,246 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 17:03:49,377 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/brs2f.c[588,601] [2024-11-19 17:03:49,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 17:03:49,408 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 17:03:49,421 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/brs2f.c[588,601] [2024-11-19 17:03:49,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 17:03:49,444 INFO L204 MainTranslator]: Completed translation [2024-11-19 17:03:49,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:49 WrapperNode [2024-11-19 17:03:49,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 17:03:49,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 17:03:49,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 17:03:49,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 17:03:49,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:49" (1/1) ... [2024-11-19 17:03:49,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:49" (1/1) ... [2024-11-19 17:03:49,488 INFO L138 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2024-11-19 17:03:49,489 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 17:03:49,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 17:03:49,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 17:03:49,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 17:03:49,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:49" (1/1) ... [2024-11-19 17:03:49,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:49" (1/1) ... [2024-11-19 17:03:49,500 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:49" (1/1) ... [2024-11-19 17:03:49,511 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 8, 3, 4]. 47 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0, 0]. The 4 writes are split as follows [0, 0, 2, 2]. [2024-11-19 17:03:49,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:49" (1/1) ... [2024-11-19 17:03:49,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:49" (1/1) ... [2024-11-19 17:03:49,522 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:49" (1/1) ... [2024-11-19 17:03:49,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:49" (1/1) ... [2024-11-19 17:03:49,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:49" (1/1) ... [2024-11-19 17:03:49,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:49" (1/1) ... [2024-11-19 17:03:49,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 17:03:49,537 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 17:03:49,537 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 17:03:49,537 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 17:03:49,538 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:49" (1/1) ... [2024-11-19 17:03:49,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 17:03:49,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:03:49,578 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-19 17:03:49,589 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-19 17:03:49,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 17:03:49,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 17:03:49,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 17:03:49,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 17:03:49,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 17:03:49,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 17:03:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 17:03:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 17:03:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 17:03:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 17:03:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 17:03:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 17:03:49,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 17:03:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 17:03:49,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 17:03:49,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 17:03:49,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 17:03:49,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 17:03:49,688 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 17:03:49,690 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 17:03:49,803 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-19 17:03:49,803 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 17:03:49,813 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 17:03:49,813 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 17:03:49,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:03:49 BoogieIcfgContainer [2024-11-19 17:03:49,813 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 17:03:49,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 17:03:49,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 17:03:49,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 17:03:49,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:03:49" (1/3) ... [2024-11-19 17:03:49,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc349c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:03:49, skipping insertion in model container [2024-11-19 17:03:49,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:03:49" (2/3) ... [2024-11-19 17:03:49,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc349c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:03:49, skipping insertion in model container [2024-11-19 17:03:49,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:03:49" (3/3) ... [2024-11-19 17:03:49,824 INFO L112 eAbstractionObserver]: Analyzing ICFG brs2f.c [2024-11-19 17:03:49,838 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 17:03:49,838 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 17:03:49,882 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 17:03:49,888 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;@56a8cf7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 17:03:49,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 17:03:49,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:03:49,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 17:03:49,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:03:49,897 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:03:49,897 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:03:49,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:03:49,902 INFO L85 PathProgramCache]: Analyzing trace with hash 361760665, now seen corresponding path program 1 times [2024-11-19 17:03:49,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:03:49,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148315379] [2024-11-19 17:03:49,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:03:49,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:03:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:03:50,046 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-19 17:03:50,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:03:50,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148315379] [2024-11-19 17:03:50,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148315379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:03:50,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:03:50,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 17:03:50,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720415968] [2024-11-19 17:03:50,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:03:50,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 17:03:50,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:03:50,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 17:03:50,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 17:03:50,075 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:03:50,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:03:50,085 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2024-11-19 17:03:50,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 17:03:50,087 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-19 17:03:50,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:03:50,092 INFO L225 Difference]: With dead ends: 36 [2024-11-19 17:03:50,092 INFO L226 Difference]: Without dead ends: 16 [2024-11-19 17:03:50,095 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-19 17:03:50,097 INFO L432 NwaCegarLoop]: 24 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, 24 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-19 17:03:50,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:03:50,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-19 17:03:50,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-19 17:03:50,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:03:50,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-11-19 17:03:50,121 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2024-11-19 17:03:50,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:03:50,122 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-11-19 17:03:50,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:03:50,122 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2024-11-19 17:03:50,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 17:03:50,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:03:50,123 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:03:50,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 17:03:50,123 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:03:50,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:03:50,124 INFO L85 PathProgramCache]: Analyzing trace with hash -447913662, now seen corresponding path program 1 times [2024-11-19 17:03:50,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:03:50,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57374279] [2024-11-19 17:03:50,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:03:50,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:03:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:03:50,290 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-19 17:03:50,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:03:50,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57374279] [2024-11-19 17:03:50,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57374279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:03:50,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:03:50,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 17:03:50,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566459631] [2024-11-19 17:03:50,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:03:50,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 17:03:50,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:03:50,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 17:03:50,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 17:03:50,294 INFO L87 Difference]: Start difference. First operand 16 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) [2024-11-19 17:03:50,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:03:50,348 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2024-11-19 17:03:50,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 17:03:50,349 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 [2024-11-19 17:03:50,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:03:50,349 INFO L225 Difference]: With dead ends: 33 [2024-11-19 17:03:50,350 INFO L226 Difference]: Without dead ends: 22 [2024-11-19 17:03:50,350 INFO L431 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 [2024-11-19 17:03:50,351 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:03:50,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 12 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:03:50,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-19 17:03:50,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-11-19 17:03:50,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:03:50,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-19 17:03:50,357 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 11 [2024-11-19 17:03:50,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:03:50,357 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-19 17:03:50,357 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) [2024-11-19 17:03:50,357 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-11-19 17:03:50,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 17:03:50,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:03:50,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:03:50,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 17:03:50,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:03:50,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:03:50,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1044113915, now seen corresponding path program 1 times [2024-11-19 17:03:50,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:03:50,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634333065] [2024-11-19 17:03:50,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:03:50,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:03:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:03:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 17:03:50,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:03:50,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634333065] [2024-11-19 17:03:50,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634333065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:03:50,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:03:50,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 17:03:50,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027915242] [2024-11-19 17:03:50,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:03:50,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 17:03:50,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:03:50,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 17:03:50,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 17:03:50,620 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:03:50,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:03:50,662 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-11-19 17:03:50,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 17:03:50,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-19 17:03:50,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:03:50,663 INFO L225 Difference]: With dead ends: 27 [2024-11-19 17:03:50,663 INFO L226 Difference]: Without dead ends: 23 [2024-11-19 17:03:50,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 17:03:50,664 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:03:50,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 31 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:03:50,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-19 17:03:50,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-11-19 17:03:50,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 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-19 17:03:50,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-19 17:03:50,669 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2024-11-19 17:03:50,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:03:50,669 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-19 17:03:50,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:03:50,669 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-19 17:03:50,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 17:03:50,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:03:50,670 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:03:50,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 17:03:50,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:03:50,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:03:50,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1654199858, now seen corresponding path program 1 times [2024-11-19 17:03:50,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:03:50,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957958754] [2024-11-19 17:03:50,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:03:50,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:03:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:03:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:03:50,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:03:50,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957958754] [2024-11-19 17:03:50,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957958754] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:03:50,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337594612] [2024-11-19 17:03:50,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:03:50,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:03:50,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:03:50,783 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-19 17:03:50,786 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-19 17:03:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:03:50,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 17:03:50,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:03:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:03:50,958 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:03:50,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:03:50,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337594612] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:03:50,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 17:03:50,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-19 17:03:50,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547391544] [2024-11-19 17:03:50,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 17:03:50,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 17:03:50,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:03:50,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 17:03:50,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-19 17:03:50,998 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:03:51,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:03:51,066 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2024-11-19 17:03:51,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 17:03:51,067 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-19 17:03:51,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:03:51,067 INFO L225 Difference]: With dead ends: 43 [2024-11-19 17:03:51,067 INFO L226 Difference]: Without dead ends: 29 [2024-11-19 17:03:51,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-19 17:03:51,069 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 17:03:51,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 17:03:51,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-19 17:03:51,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2024-11-19 17:03:51,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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-19 17:03:51,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-19 17:03:51,074 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 20 [2024-11-19 17:03:51,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:03:51,074 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-19 17:03:51,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:03:51,074 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-11-19 17:03:51,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 17:03:51,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:03:51,075 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:03:51,083 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-19 17:03:51,279 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-19 17:03:51,281 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:03:51,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:03:51,281 INFO L85 PathProgramCache]: Analyzing trace with hash 168847774, now seen corresponding path program 1 times [2024-11-19 17:03:51,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:03:51,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80182028] [2024-11-19 17:03:51,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:03:51,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:03:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:03:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:03:51,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:03:51,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80182028] [2024-11-19 17:03:51,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80182028] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:03:51,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676267918] [2024-11-19 17:03:51,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:03:51,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:03:51,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:03:51,788 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 17:03:51,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 17:03:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:03:51,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 17:03:51,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:03:51,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 17:03:51,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 17:03:52,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 17:03:52,067 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 23 treesize of output 3 [2024-11-19 17:03:52,116 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 [2024-11-19 17:03:52,145 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:03:52,146 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:03:52,288 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 20 treesize of output 18 [2024-11-19 17:03:52,293 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 28 treesize of output 24 [2024-11-19 17:03:52,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:03:52,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676267918] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:03:52,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 17:03:52,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 27 [2024-11-19 17:03:52,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034521255] [2024-11-19 17:03:52,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 17:03:52,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-19 17:03:52,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:03:52,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-19 17:03:52,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2024-11-19 17:03:52,363 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 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-19 17:03:52,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:03:52,633 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2024-11-19 17:03:52,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 17:03:52,634 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-19 17:03:52,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:03:52,634 INFO L225 Difference]: With dead ends: 50 [2024-11-19 17:03:52,635 INFO L226 Difference]: Without dead ends: 30 [2024-11-19 17:03:52,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=803, Unknown=0, NotChecked=0, Total=992 [2024-11-19 17:03:52,637 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 34 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 17:03:52,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 52 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 17:03:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-19 17:03:52,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-11-19 17:03:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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-19 17:03:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-11-19 17:03:52,645 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 23 [2024-11-19 17:03:52,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:03:52,646 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-19 17:03:52,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 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-19 17:03:52,646 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-11-19 17:03:52,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 17:03:52,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:03:52,647 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:03:52,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 17:03:52,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:03:52,848 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:03:52,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:03:52,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1961352373, now seen corresponding path program 2 times [2024-11-19 17:03:52,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:03:52,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770088663] [2024-11-19 17:03:52,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:03:52,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:03:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:03:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:03:52,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:03:52,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770088663] [2024-11-19 17:03:52,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770088663] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:03:52,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655727187] [2024-11-19 17:03:52,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 17:03:52,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:03:52,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:03:52,985 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 17:03:52,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 17:03:53,049 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 17:03:53,050 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 17:03:53,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 17:03:53,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:03:53,122 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:03:53,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:03:53,188 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:03:53,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655727187] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:03:53,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 17:03:53,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-11-19 17:03:53,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612884769] [2024-11-19 17:03:53,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 17:03:53,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 17:03:53,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:03:53,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 17:03:53,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-19 17:03:53,190 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 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-19 17:03:53,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:03:53,307 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2024-11-19 17:03:53,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 17:03:53,308 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 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 26 [2024-11-19 17:03:53,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:03:53,308 INFO L225 Difference]: With dead ends: 54 [2024-11-19 17:03:53,308 INFO L226 Difference]: Without dead ends: 34 [2024-11-19 17:03:53,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-19 17:03:53,309 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 17:03:53,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 35 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 17:03:53,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-19 17:03:53,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2024-11-19 17:03:53,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 17:03:53,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-19 17:03:53,314 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 26 [2024-11-19 17:03:53,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:03:53,315 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-19 17:03:53,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 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-19 17:03:53,315 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-19 17:03:53,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 17:03:53,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:03:53,316 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:03:53,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 17:03:53,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:03:53,517 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:03:53,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:03:53,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1507669223, now seen corresponding path program 3 times [2024-11-19 17:03:53,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:03:53,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250395311] [2024-11-19 17:03:53,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:03:53,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:03:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 17:03:53,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 17:03:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 17:03:53,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 17:03:53,578 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 17:03:53,578 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 17:03:53,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 17:03:53,582 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-11-19 17:03:53,600 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 17:03:53,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:03:53 BoogieIcfgContainer [2024-11-19 17:03:53,602 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 17:03:53,603 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 17:03:53,603 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 17:03:53,603 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 17:03:53,603 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:03:49" (3/4) ... [2024-11-19 17:03:53,604 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 17:03:53,637 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 17:03:53,637 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 17:03:53,637 INFO L158 Benchmark]: Toolchain (without parser) took 4419.86ms. Allocated memory was 184.5MB in the beginning and 306.2MB in the end (delta: 121.6MB). Free memory was 125.8MB in the beginning and 269.5MB in the end (delta: -143.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 17:03:53,638 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 184.5MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 17:03:53,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.38ms. Allocated memory is still 184.5MB. Free memory was 125.8MB in the beginning and 113.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 17:03:53,638 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.18ms. Allocated memory is still 184.5MB. Free memory was 112.8MB in the beginning and 111.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 17:03:53,638 INFO L158 Benchmark]: Boogie Preprocessor took 46.72ms. Allocated memory is still 184.5MB. Free memory was 111.1MB in the beginning and 109.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 17:03:53,638 INFO L158 Benchmark]: RCFGBuilder took 276.65ms. Allocated memory is still 184.5MB. Free memory was 109.3MB in the beginning and 96.0MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 17:03:53,639 INFO L158 Benchmark]: TraceAbstraction took 3786.97ms. Allocated memory was 184.5MB in the beginning and 306.2MB in the end (delta: 121.6MB). Free memory was 95.1MB in the beginning and 271.6MB in the end (delta: -176.5MB). Peak memory consumption was 125.7MB. Max. memory is 16.1GB. [2024-11-19 17:03:53,639 INFO L158 Benchmark]: Witness Printer took 34.43ms. Allocated memory is still 306.2MB. Free memory was 271.5MB in the beginning and 269.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 17:03:53,640 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.09ms. Allocated memory is still 184.5MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.38ms. Allocated memory is still 184.5MB. Free memory was 125.8MB in the beginning and 113.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.18ms. Allocated memory is still 184.5MB. Free memory was 112.8MB in the beginning and 111.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.72ms. Allocated memory is still 184.5MB. Free memory was 111.1MB in the beginning and 109.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 276.65ms. Allocated memory is still 184.5MB. Free memory was 109.3MB in the beginning and 96.0MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3786.97ms. Allocated memory was 184.5MB in the beginning and 306.2MB in the end (delta: 121.6MB). Free memory was 95.1MB in the beginning and 271.6MB in the end (delta: -176.5MB). Peak memory consumption was 125.7MB. Max. memory is 16.1GB. * Witness Printer took 34.43ms. Allocated memory is still 306.2MB. Free memory was 271.5MB in the beginning and 269.5MB in the end (delta: 2.0MB). 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: 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=3] [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] i=0 VAL [N=3, a={-1:0}, i=0, sum={9:0}] [L31] COND TRUE i