./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/brs2f.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:22:13,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:22:13,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 18:22:13,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:22:13,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:22:13,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:22:13,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:22:13,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:22:13,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:22:13,470 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:22:13,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:22:13,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:22:13,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:22:13,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:22:13,472 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:22:13,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:22:13,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:22:13,472 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:22:13,473 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 18:22:13,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:22:13,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:22:13,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:22:13,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:22:13,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:22:13,475 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:22:13,475 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:22:13,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:22:13,476 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:22:13,476 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:22:13,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:22:13,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:22:13,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:22:13,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:22:13,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:22:13,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:22:13,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:22:13,478 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 18:22:13,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 18:22:13,478 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:22:13,479 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:22:13,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:22:13,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:22:13,480 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f5f17f058e96bd5c46baa242826f383c90eaddfa4dbca636ab924160b7cdb4ab [2024-11-09 18:22:13,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:22:13,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:22:13,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:22:13,708 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:22:13,708 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:22:13,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/brs2f.c [2024-11-09 18:22:15,297 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:22:15,455 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:22:15,456 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs2f.c [2024-11-09 18:22:15,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cafb438d/93ee13625f804940bd3d3c76b753a0d7/FLAG24de5ffa4 [2024-11-09 18:22:15,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cafb438d/93ee13625f804940bd3d3c76b753a0d7 [2024-11-09 18:22:15,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:22:15,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:22:15,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:22:15,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:22:15,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:22:15,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:22:15" (1/1) ... [2024-11-09 18:22:15,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4de94c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:22:15, skipping insertion in model container [2024-11-09 18:22:15,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:22:15" (1/1) ... [2024-11-09 18:22:15,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:22:15,674 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-09 18:22:15,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:22:15,714 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:22:15,723 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-09 18:22:15,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:22:15,749 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:22:15,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:22:15 WrapperNode [2024-11-09 18:22:15,750 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:22:15,751 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:22:15,751 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:22:15,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:22:15,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:22:15" (1/1) ... [2024-11-09 18:22:15,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:22:15" (1/1) ... [2024-11-09 18:22:15,779 INFO L138 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2024-11-09 18:22:15,780 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:22:15,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:22:15,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:22:15,781 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:22:15,789 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:22:15" (1/1) ... [2024-11-09 18:22:15,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:22:15" (1/1) ... [2024-11-09 18:22:15,795 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:22:15" (1/1) ... [2024-11-09 18:22:15,812 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-09 18:22:15,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:22:15" (1/1) ... [2024-11-09 18:22:15,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:22:15" (1/1) ... [2024-11-09 18:22:15,819 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:22:15" (1/1) ... [2024-11-09 18:22:15,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:22:15" (1/1) ... [2024-11-09 18:22:15,823 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:22:15" (1/1) ... [2024-11-09 18:22:15,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:22:15" (1/1) ... [2024-11-09 18:22:15,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:22:15,830 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:22:15,834 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:22:15,834 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:22:15,835 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:22:15" (1/1) ... [2024-11-09 18:22:15,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:22:15,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:22:15,868 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 18:22:15,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 18:22:15,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:22:15,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 18:22:15,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 18:22:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 18:22:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 18:22:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 18:22:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 18:22:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 18:22:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 18:22:15,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 18:22:15,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 18:22:15,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:22:15,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:22:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 18:22:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 18:22:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 18:22:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 18:22:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 18:22:15,992 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:22:15,994 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:22:16,132 INFO L1247 $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; [2024-11-09 18:22:16,138 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-09 18:22:16,138 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:22:16,147 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:22:16,147 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 18:22:16,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:22:16 BoogieIcfgContainer [2024-11-09 18:22:16,147 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:22:16,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:22:16,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:22:16,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:22:16,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:22:15" (1/3) ... [2024-11-09 18:22:16,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d38cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:22:16, skipping insertion in model container [2024-11-09 18:22:16,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:22:15" (2/3) ... [2024-11-09 18:22:16,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d38cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:22:16, skipping insertion in model container [2024-11-09 18:22:16,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:22:16" (3/3) ... [2024-11-09 18:22:16,154 INFO L112 eAbstractionObserver]: Analyzing ICFG brs2f.c [2024-11-09 18:22:16,167 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:22:16,167 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:22:16,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:22:16,217 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;@5f68daa3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:22:16,217 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:22:16,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 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) [2024-11-09 18:22:16,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 18:22:16,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:22:16,225 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:22:16,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:22:16,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:22:16,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1176406123, now seen corresponding path program 1 times [2024-11-09 18:22:16,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:22:16,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198696736] [2024-11-09 18:22:16,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:22:16,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:22:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:22:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:22:16,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:22:16,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198696736] [2024-11-09 18:22:16,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198696736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:22:16,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:22:16,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:22:16,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916854568] [2024-11-09 18:22:16,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:22:16,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 18:22:16,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:22:16,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 18:22:16,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 18:22:16,413 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 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) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:22:16,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:22:16,424 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2024-11-09 18:22:16,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 18:22:16,426 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 18:22:16,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:22:16,432 INFO L225 Difference]: With dead ends: 43 [2024-11-09 18:22:16,433 INFO L226 Difference]: Without dead ends: 19 [2024-11-09 18:22:16,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 18:22:16,439 INFO L432 NwaCegarLoop]: 27 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, 27 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:22:16,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:22:16,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-09 18:22:16,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-09 18:22:16,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:22:16,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-09 18:22:16,464 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2024-11-09 18:22:16,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:22:16,464 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-09 18:22:16,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:22:16,464 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-11-09 18:22:16,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 18:22:16,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:22:16,465 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:22:16,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 18:22:16,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:22:16,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:22:16,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1493164272, now seen corresponding path program 1 times [2024-11-09 18:22:16,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:22:16,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602072628] [2024-11-09 18:22:16,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:22:16,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:22:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:22:16,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:22:16,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:22:16,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602072628] [2024-11-09 18:22:16,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602072628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:22:16,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:22:16,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:22:16,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186691494] [2024-11-09 18:22:16,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:22:16,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:22:16,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:22:16,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:22:16,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:22:16,653 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:22:16,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:22:16,703 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2024-11-09 18:22:16,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:22:16,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-11-09 18:22:16,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:22:16,704 INFO L225 Difference]: With dead ends: 41 [2024-11-09 18:22:16,704 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 18:22:16,705 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-09 18:22:16,706 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 18 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.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:22:16,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 18 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:22:16,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 18:22:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2024-11-09 18:22:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 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-09 18:22:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-11-09 18:22:16,712 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2024-11-09 18:22:16,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:22:16,712 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-11-09 18:22:16,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:22:16,713 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-11-09 18:22:16,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 18:22:16,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:22:16,713 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:22:16,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 18:22:16,714 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:22:16,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:22:16,715 INFO L85 PathProgramCache]: Analyzing trace with hash -75358128, now seen corresponding path program 1 times [2024-11-09 18:22:16,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:22:16,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816292108] [2024-11-09 18:22:16,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:22:16,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:22:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:22:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 18:22:16,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:22:16,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816292108] [2024-11-09 18:22:16,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816292108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:22:16,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:22:16,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 18:22:16,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053934425] [2024-11-09 18:22:16,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:22:16,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 18:22:16,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:22:16,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 18:22:16,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:22:16,938 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:22:16,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:22:16,972 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-11-09 18:22:16,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 18:22:16,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 18:22:16,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:22:16,973 INFO L225 Difference]: With dead ends: 34 [2024-11-09 18:22:16,974 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 18:22:16,974 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-09 18:22:16,975 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:22:16,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 42 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:22:16,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 18:22:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-09 18:22:16,978 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-09 18:22:16,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-11-09 18:22:16,979 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2024-11-09 18:22:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:22:16,979 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-09 18:22:16,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:22:16,980 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-11-09 18:22:16,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 18:22:16,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:22:16,980 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:22:16,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 18:22:16,981 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:22:16,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:22:16,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1404754963, now seen corresponding path program 1 times [2024-11-09 18:22:16,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:22:16,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951239889] [2024-11-09 18:22:16,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:22:16,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:22:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:22:17,088 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:22:17,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:22:17,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951239889] [2024-11-09 18:22:17,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951239889] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:22:17,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372508383] [2024-11-09 18:22:17,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:22:17,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:22:17,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:22:17,093 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:22:17,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 18:22:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:22:17,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 18:22:17,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:22:17,230 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:22:17,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:22:17,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:22:17,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372508383] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:22:17,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:22:17,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-09 18:22:17,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578530194] [2024-11-09 18:22:17,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:22:17,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 18:22:17,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:22:17,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 18:22:17,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-09 18:22:17,280 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:22:17,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:22:17,343 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2024-11-09 18:22:17,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 18:22:17,344 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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-09 18:22:17,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:22:17,344 INFO L225 Difference]: With dead ends: 55 [2024-11-09 18:22:17,345 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 18:22:17,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 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-09 18:22:17,346 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:22:17,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 56 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:22:17,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 18:22:17,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2024-11-09 18:22:17,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:22:17,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-09 18:22:17,350 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 26 [2024-11-09 18:22:17,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:22:17,351 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-09 18:22:17,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:22:17,351 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-09 18:22:17,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 18:22:17,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:22:17,352 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:22:17,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 18:22:17,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:22:17,553 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:22:17,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:22:17,554 INFO L85 PathProgramCache]: Analyzing trace with hash 667119152, now seen corresponding path program 1 times [2024-11-09 18:22:17,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:22:17,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217842459] [2024-11-09 18:22:17,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:22:17,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:22:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:22:18,187 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:22:18,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:22:18,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217842459] [2024-11-09 18:22:18,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217842459] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:22:18,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067339614] [2024-11-09 18:22:18,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:22:18,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:22:18,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:22:18,190 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-09 18:22:18,191 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-09 18:22:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:22:18,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 18:22:18,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:22:18,299 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-09 18:22:18,351 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-09 18:22:18,418 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 19 treesize of output 11 [2024-11-09 18:22:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:22:18,490 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:22:18,619 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-09 18:22:18,623 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 26 treesize of output 22 [2024-11-09 18:22:18,697 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:22:18,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067339614] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:22:18,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:22:18,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 25 [2024-11-09 18:22:18,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769748599] [2024-11-09 18:22:18,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:22:18,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 18:22:18,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:22:18,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 18:22:18,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2024-11-09 18:22:18,701 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:22:18,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:22:18,912 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2024-11-09 18:22:18,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 18:22:18,913 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 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 30 [2024-11-09 18:22:18,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:22:18,914 INFO L225 Difference]: With dead ends: 64 [2024-11-09 18:22:18,914 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 18:22:18,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2024-11-09 18:22:18,915 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:22:18,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 132 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:22:18,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 18:22:18,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-11-09 18:22:18,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:22:18,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-09 18:22:18,919 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 30 [2024-11-09 18:22:18,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:22:18,919 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-09 18:22:18,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:22:18,919 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-09 18:22:18,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 18:22:18,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:22:18,920 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:22:18,939 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-09 18:22:19,121 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-09 18:22:19,121 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:22:19,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:22:19,122 INFO L85 PathProgramCache]: Analyzing trace with hash 426541517, now seen corresponding path program 2 times [2024-11-09 18:22:19,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:22:19,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763541256] [2024-11-09 18:22:19,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:22:19,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:22:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:22:19,207 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:22:19,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:22:19,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763541256] [2024-11-09 18:22:19,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763541256] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:22:19,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838231636] [2024-11-09 18:22:19,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 18:22:19,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:22:19,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:22:19,213 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-09 18:22:19,221 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-09 18:22:19,275 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 18:22:19,275 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 18:22:19,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 18:22:19,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:22:19,342 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:22:19,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:22:19,391 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:22:19,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838231636] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:22:19,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:22:19,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-11-09 18:22:19,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938517206] [2024-11-09 18:22:19,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:22:19,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 18:22:19,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:22:19,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 18:22:19,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-09 18:22:19,393 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:22:19,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:22:19,473 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2024-11-09 18:22:19,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 18:22:19,473 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 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 34 [2024-11-09 18:22:19,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:22:19,474 INFO L225 Difference]: With dead ends: 70 [2024-11-09 18:22:19,474 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 18:22:19,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 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-09 18:22:19,475 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:22:19,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 81 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:22:19,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 18:22:19,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2024-11-09 18:22:19,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:22:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-11-09 18:22:19,479 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 34 [2024-11-09 18:22:19,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:22:19,479 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-11-09 18:22:19,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:22:19,480 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-11-09 18:22:19,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 18:22:19,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:22:19,480 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:22:19,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 18:22:19,681 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-09 18:22:19,681 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:22:19,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:22:19,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2101854257, now seen corresponding path program 3 times [2024-11-09 18:22:19,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:22:19,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872022886] [2024-11-09 18:22:19,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:22:19,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:22:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 18:22:19,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 18:22:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 18:22:19,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 18:22:19,731 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 18:22:19,731 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 18:22:19,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 18:22:19,735 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-11-09 18:22:19,759 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 18:22:19,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:22:19 BoogieIcfgContainer [2024-11-09 18:22:19,761 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 18:22:19,762 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 18:22:19,762 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 18:22:19,762 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 18:22:19,762 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:22:16" (3/4) ... [2024-11-09 18:22:19,763 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 18:22:19,795 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 18:22:19,796 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 18:22:19,796 INFO L158 Benchmark]: Toolchain (without parser) took 4317.54ms. Allocated memory was 167.8MB in the beginning and 224.4MB in the end (delta: 56.6MB). Free memory was 96.9MB in the beginning and 94.2MB in the end (delta: 2.7MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. [2024-11-09 18:22:19,796 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:22:19,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.99ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 137.5MB in the end (delta: -40.8MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-09 18:22:19,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.36ms. Allocated memory is still 167.8MB. Free memory was 137.5MB in the beginning and 136.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:22:19,797 INFO L158 Benchmark]: Boogie Preprocessor took 48.74ms. Allocated memory is still 167.8MB. Free memory was 136.5MB in the beginning and 134.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 18:22:19,797 INFO L158 Benchmark]: IcfgBuilder took 317.55ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 120.8MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 18:22:19,797 INFO L158 Benchmark]: TraceAbstraction took 3612.07ms. Allocated memory was 167.8MB in the beginning and 224.4MB in the end (delta: 56.6MB). Free memory was 119.8MB in the beginning and 96.3MB in the end (delta: 23.5MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. [2024-11-09 18:22:19,797 INFO L158 Benchmark]: Witness Printer took 34.15ms. Allocated memory is still 224.4MB. Free memory was 96.3MB in the beginning and 94.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 18:22:19,799 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.17ms. Allocated memory is still 167.8MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.99ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 137.5MB in the end (delta: -40.8MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.36ms. Allocated memory is still 167.8MB. Free memory was 137.5MB in the beginning and 136.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.74ms. Allocated memory is still 167.8MB. Free memory was 136.5MB in the beginning and 134.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 317.55ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 120.8MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3612.07ms. Allocated memory was 167.8MB in the beginning and 224.4MB in the end (delta: 56.6MB). Free memory was 119.8MB in the beginning and 96.3MB in the end (delta: 23.5MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. * Witness Printer took 34.15ms. Allocated memory is still 224.4MB. Free memory was 96.3MB in the beginning and 94.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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