./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/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/reducercommutativity/rangesum10.i -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.graphml --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 43671c88cb28f81a53d6c7fbea907e55b0f99c68f8a522c4103c0a12ddf9f652 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-20 21:02:52,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 21:02:52,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 21:02:52,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 21:02:52,872 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 21:02:52,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 21:02:52,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 21:02:52,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 21:02:52,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 21:02:52,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 21:02:52,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 21:02:52,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 21:02:52,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 21:02:52,887 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 21:02:52,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 21:02:52,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 21:02:52,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 21:02:52,897 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 21:02:52,899 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 21:02:52,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 21:02:52,907 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 21:02:52,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 21:02:52,912 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 21:02:52,913 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 21:02:52,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 21:02:52,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 21:02:52,919 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 21:02:52,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 21:02:52,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 21:02:52,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 21:02:52,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 21:02:52,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 21:02:52,923 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 21:02:52,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 21:02:52,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 21:02:52,926 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 21:02:52,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 21:02:52,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 21:02:52,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 21:02:52,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 21:02:52,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 21:02:52,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 21:02:52,931 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-20 21:02:52,950 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 21:02:52,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 21:02:52,951 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 21:02:52,951 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 21:02:52,952 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 21:02:52,952 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 21:02:52,953 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 21:02:52,953 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 21:02:52,953 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 21:02:52,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 21:02:52,954 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 21:02:52,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 21:02:52,954 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 21:02:52,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 21:02:52,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 21:02:52,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 21:02:52,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 21:02:52,955 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 21:02:52,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 21:02:52,956 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 21:02:52,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 21:02:52,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 21:02:52,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 21:02:52,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 21:02:52,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 21:02:52,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 21:02:52,957 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 21:02:52,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 21:02:52,958 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 21:02:52,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 21:02:52,958 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 21:02:52,958 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 21:02:52,959 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 21:02:52,959 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> 43671c88cb28f81a53d6c7fbea907e55b0f99c68f8a522c4103c0a12ddf9f652 [2022-07-20 21:02:53,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 21:02:53,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 21:02:53,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 21:02:53,215 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 21:02:53,216 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 21:02:53,218 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum10.i [2022-07-20 21:02:53,289 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12e287422/5bbfe4a052124682b14c4aca12962b63/FLAGcb7df1888 [2022-07-20 21:02:53,712 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 21:02:53,713 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum10.i [2022-07-20 21:02:53,722 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12e287422/5bbfe4a052124682b14c4aca12962b63/FLAGcb7df1888 [2022-07-20 21:02:54,122 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12e287422/5bbfe4a052124682b14c4aca12962b63 [2022-07-20 21:02:54,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 21:02:54,132 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 21:02:54,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 21:02:54,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 21:02:54,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 21:02:54,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:02:54" (1/1) ... [2022-07-20 21:02:54,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c95d56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:02:54, skipping insertion in model container [2022-07-20 21:02:54,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:02:54" (1/1) ... [2022-07-20 21:02:54,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 21:02:54,159 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 21:02:54,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum10.i[1465,1478] [2022-07-20 21:02:54,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 21:02:54,395 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 21:02:54,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum10.i[1465,1478] [2022-07-20 21:02:54,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 21:02:54,444 INFO L208 MainTranslator]: Completed translation [2022-07-20 21:02:54,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:02:54 WrapperNode [2022-07-20 21:02:54,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 21:02:54,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 21:02:54,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 21:02:54,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 21:02:54,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:02:54" (1/1) ... [2022-07-20 21:02:54,467 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:02:54" (1/1) ... [2022-07-20 21:02:54,489 INFO L137 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2022-07-20 21:02:54,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 21:02:54,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 21:02:54,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 21:02:54,491 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 21:02:54,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:02:54" (1/1) ... [2022-07-20 21:02:54,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:02:54" (1/1) ... [2022-07-20 21:02:54,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:02:54" (1/1) ... [2022-07-20 21:02:54,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:02:54" (1/1) ... [2022-07-20 21:02:54,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:02:54" (1/1) ... [2022-07-20 21:02:54,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:02:54" (1/1) ... [2022-07-20 21:02:54,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:02:54" (1/1) ... [2022-07-20 21:02:54,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 21:02:54,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 21:02:54,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 21:02:54,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 21:02:54,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:02:54" (1/1) ... [2022-07-20 21:02:54,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 21:02:54,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:02:54,577 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 21:02:54,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 21:02:54,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 21:02:54,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 21:02:54,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 21:02:54,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 21:02:54,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 21:02:54,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 21:02:54,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 21:02:54,625 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2022-07-20 21:02:54,625 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2022-07-20 21:02:54,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 21:02:54,705 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 21:02:54,707 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 21:02:54,917 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 21:02:54,922 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 21:02:54,923 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-20 21:02:54,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:02:54 BoogieIcfgContainer [2022-07-20 21:02:54,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 21:02:54,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 21:02:54,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 21:02:54,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 21:02:54,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 09:02:54" (1/3) ... [2022-07-20 21:02:54,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417187bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:02:54, skipping insertion in model container [2022-07-20 21:02:54,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:02:54" (2/3) ... [2022-07-20 21:02:54,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417187bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:02:54, skipping insertion in model container [2022-07-20 21:02:54,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:02:54" (3/3) ... [2022-07-20 21:02:54,945 INFO L111 eAbstractionObserver]: Analyzing ICFG rangesum10.i [2022-07-20 21:02:54,962 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 21:02:54,962 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 21:02:55,022 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 21:02:55,035 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5060ebd6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@59a21d4d [2022-07-20 21:02:55,035 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 21:02:55,044 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 21:02:55,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 21:02:55,052 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:02:55,052 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:02:55,053 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:02:55,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:02:55,061 INFO L85 PathProgramCache]: Analyzing trace with hash -275565944, now seen corresponding path program 1 times [2022-07-20 21:02:55,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:02:55,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757704912] [2022-07-20 21:02:55,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:02:55,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:02:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:02:55,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-20 21:02:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:02:55,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 21:02:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:02:55,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 21:02:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:02:55,282 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 21:02:55,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:02:55,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757704912] [2022-07-20 21:02:55,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757704912] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:02:55,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:02:55,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 21:02:55,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28865487] [2022-07-20 21:02:55,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:02:55,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 21:02:55,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:02:55,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 21:02:55,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 21:02:55,313 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 21:02:55,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:02:55,340 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2022-07-20 21:02:55,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 21:02:55,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-07-20 21:02:55,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:02:55,355 INFO L225 Difference]: With dead ends: 54 [2022-07-20 21:02:55,355 INFO L226 Difference]: Without dead ends: 26 [2022-07-20 21:02:55,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 21:02:55,365 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:02:55,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 62 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:02:55,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-20 21:02:55,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-07-20 21:02:55,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 21:02:55,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-07-20 21:02:55,405 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 29 [2022-07-20 21:02:55,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:02:55,406 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-07-20 21:02:55,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 21:02:55,407 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-07-20 21:02:55,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 21:02:55,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:02:55,410 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:02:55,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 21:02:55,412 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:02:55,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:02:55,414 INFO L85 PathProgramCache]: Analyzing trace with hash -653100523, now seen corresponding path program 1 times [2022-07-20 21:02:55,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:02:55,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353228364] [2022-07-20 21:02:55,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:02:55,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:02:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:02:55,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 21:02:55,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:02:55,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353228364] [2022-07-20 21:02:55,517 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-07-20 21:02:55,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226307063] [2022-07-20 21:02:55,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:02:55,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:02:55,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:02:55,520 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) [2022-07-20 21:02:55,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 21:02:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:02:55,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 21:02:55,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:02:55,666 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 21:02:55,667 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 21:02:55,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226307063] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:02:55,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:02:55,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 21:02:55,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361911446] [2022-07-20 21:02:55,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:02:55,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 21:02:55,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:02:55,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 21:02:55,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 21:02:55,680 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 21:02:55,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:02:55,718 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-07-20 21:02:55,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 21:02:55,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-07-20 21:02:55,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:02:55,719 INFO L225 Difference]: With dead ends: 46 [2022-07-20 21:02:55,719 INFO L226 Difference]: Without dead ends: 28 [2022-07-20 21:02:55,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 21:02:55,721 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:02:55,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:02:55,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-20 21:02:55,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-20 21:02:55,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 21:02:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-07-20 21:02:55,735 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 31 [2022-07-20 21:02:55,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:02:55,735 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-07-20 21:02:55,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 21:02:55,736 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-07-20 21:02:55,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 21:02:55,737 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:02:55,737 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:02:55,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 21:02:55,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:02:55,938 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:02:55,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:02:55,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1081404920, now seen corresponding path program 1 times [2022-07-20 21:02:55,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:02:55,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805850197] [2022-07-20 21:02:55,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:02:55,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:02:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:02:56,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 21:02:56,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:02:56,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805850197] [2022-07-20 21:02:56,012 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-07-20 21:02:56,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520169742] [2022-07-20 21:02:56,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:02:56,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:02:56,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:02:56,016 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) [2022-07-20 21:02:56,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 21:02:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:02:56,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 21:02:56,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:02:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-20 21:02:56,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 21:02:56,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520169742] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:02:56,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:02:56,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 21:02:56,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123502612] [2022-07-20 21:02:56,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:02:56,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 21:02:56,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:02:56,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 21:02:56,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 21:02:56,142 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 21:02:56,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:02:56,164 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-07-20 21:02:56,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 21:02:56,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2022-07-20 21:02:56,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:02:56,166 INFO L225 Difference]: With dead ends: 44 [2022-07-20 21:02:56,166 INFO L226 Difference]: Without dead ends: 29 [2022-07-20 21:02:56,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 21:02:56,168 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:02:56,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 53 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:02:56,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-20 21:02:56,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-07-20 21:02:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 21:02:56,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-07-20 21:02:56,178 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 40 [2022-07-20 21:02:56,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:02:56,179 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-07-20 21:02:56,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 21:02:56,180 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-07-20 21:02:56,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 21:02:56,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:02:56,181 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:02:56,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 21:02:56,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-20 21:02:56,396 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:02:56,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:02:56,396 INFO L85 PathProgramCache]: Analyzing trace with hash -673301430, now seen corresponding path program 1 times [2022-07-20 21:02:56,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:02:56,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380794818] [2022-07-20 21:02:56,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:02:56,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:02:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:02:56,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 21:02:56,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:02:56,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380794818] [2022-07-20 21:02:56,465 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-07-20 21:02:56,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011360845] [2022-07-20 21:02:56,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:02:56,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:02:56,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:02:56,467 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) [2022-07-20 21:02:56,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 21:02:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:02:56,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 21:02:56,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:02:56,561 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-20 21:02:56,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 21:02:56,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011360845] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:02:56,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:02:56,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 21:02:56,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120377339] [2022-07-20 21:02:56,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:02:56,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 21:02:56,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:02:56,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 21:02:56,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 21:02:56,573 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 21:02:56,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:02:56,590 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2022-07-20 21:02:56,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 21:02:56,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2022-07-20 21:02:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:02:56,596 INFO L225 Difference]: With dead ends: 55 [2022-07-20 21:02:56,596 INFO L226 Difference]: Without dead ends: 34 [2022-07-20 21:02:56,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 21:02:56,600 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:02:56,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:02:56,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-20 21:02:56,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-07-20 21:02:56,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 21:02:56,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-07-20 21:02:56,614 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 42 [2022-07-20 21:02:56,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:02:56,615 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-07-20 21:02:56,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 21:02:56,616 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-07-20 21:02:56,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 21:02:56,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:02:56,621 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:02:56,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 21:02:56,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:02:56,822 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:02:56,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:02:56,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1042180377, now seen corresponding path program 1 times [2022-07-20 21:02:56,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:02:56,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228566232] [2022-07-20 21:02:56,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:02:56,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:02:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:02:56,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 21:02:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:02:56,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 21:02:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:02:56,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 21:02:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:02:56,897 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 21:02:56,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:02:56,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228566232] [2022-07-20 21:02:56,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228566232] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:02:56,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652384495] [2022-07-20 21:02:56,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:02:56,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:02:56,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:02:56,900 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:02:56,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 21:02:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:02:57,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 21:02:57,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:02:57,055 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-20 21:02:57,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:02:57,087 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-20 21:02:57,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652384495] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:02:57,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:02:57,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-07-20 21:02:57,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528266998] [2022-07-20 21:02:57,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:02:57,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 21:02:57,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:02:57,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 21:02:57,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-20 21:02:57,090 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-20 21:02:57,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:02:57,152 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2022-07-20 21:02:57,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 21:02:57,153 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2022-07-20 21:02:57,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:02:57,154 INFO L225 Difference]: With dead ends: 69 [2022-07-20 21:02:57,156 INFO L226 Difference]: Without dead ends: 42 [2022-07-20 21:02:57,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-20 21:02:57,158 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:02:57,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 138 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:02:57,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-20 21:02:57,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-07-20 21:02:57,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 21:02:57,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-07-20 21:02:57,168 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 42 [2022-07-20 21:02:57,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:02:57,169 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-07-20 21:02:57,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-20 21:02:57,169 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-07-20 21:02:57,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-20 21:02:57,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:02:57,171 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:02:57,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 21:02:57,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:02:57,395 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:02:57,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:02:57,396 INFO L85 PathProgramCache]: Analyzing trace with hash -604386836, now seen corresponding path program 2 times [2022-07-20 21:02:57,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:02:57,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385093611] [2022-07-20 21:02:57,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:02:57,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:02:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:02:57,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 21:02:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:02:57,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 21:02:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:02:57,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-20 21:02:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:02:57,453 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-20 21:02:57,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:02:57,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385093611] [2022-07-20 21:02:57,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385093611] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:02:57,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880582527] [2022-07-20 21:02:57,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 21:02:57,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:02:57,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:02:57,456 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:02:57,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 21:02:57,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 21:02:57,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:02:57,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 21:02:57,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:02:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-07-20 21:02:57,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:02:57,645 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-07-20 21:02:57,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880582527] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:02:57,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:02:57,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2022-07-20 21:02:57,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900852484] [2022-07-20 21:02:57,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:02:57,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 21:02:57,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:02:57,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 21:02:57,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-07-20 21:02:57,648 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-20 21:02:57,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:02:57,699 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2022-07-20 21:02:57,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 21:02:57,699 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2022-07-20 21:02:57,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:02:57,700 INFO L225 Difference]: With dead ends: 86 [2022-07-20 21:02:57,701 INFO L226 Difference]: Without dead ends: 56 [2022-07-20 21:02:57,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-07-20 21:02:57,702 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:02:57,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 112 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:02:57,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-20 21:02:57,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2022-07-20 21:02:57,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 21:02:57,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-07-20 21:02:57,709 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 57 [2022-07-20 21:02:57,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:02:57,709 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-07-20 21:02:57,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-20 21:02:57,710 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-07-20 21:02:57,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-20 21:02:57,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:02:57,711 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:02:57,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 21:02:57,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:02:57,924 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:02:57,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:02:57,925 INFO L85 PathProgramCache]: Analyzing trace with hash 948362870, now seen corresponding path program 1 times [2022-07-20 21:02:57,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:02:57,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807503872] [2022-07-20 21:02:57,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:02:57,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:02:57,948 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 21:02:57,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1399784298] [2022-07-20 21:02:57,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:02:57,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:02:57,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:02:57,950 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:02:57,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-20 21:02:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:02:58,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 21:02:58,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:02:58,102 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 61 proven. 7 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-07-20 21:02:58,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:02:58,158 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 5 proven. 81 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-20 21:02:58,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:02:58,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807503872] [2022-07-20 21:02:58,158 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 21:02:58,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399784298] [2022-07-20 21:02:58,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399784298] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:02:58,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 21:02:58,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-20 21:02:58,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764294091] [2022-07-20 21:02:58,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 21:02:58,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 21:02:58,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:02:58,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 21:02:58,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-20 21:02:58,161 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-20 21:02:58,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:02:58,197 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2022-07-20 21:02:58,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 21:02:58,199 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2022-07-20 21:02:58,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:02:58,200 INFO L225 Difference]: With dead ends: 89 [2022-07-20 21:02:58,200 INFO L226 Difference]: Without dead ends: 63 [2022-07-20 21:02:58,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-20 21:02:58,201 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:02:58,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:02:58,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-20 21:02:58,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-07-20 21:02:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 58 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 21:02:58,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2022-07-20 21:02:58,208 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 78 [2022-07-20 21:02:58,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:02:58,208 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2022-07-20 21:02:58,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-20 21:02:58,208 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-07-20 21:02:58,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-20 21:02:58,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:02:58,210 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 18, 10, 10, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:02:58,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-20 21:02:58,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:02:58,425 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:02:58,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:02:58,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1285665462, now seen corresponding path program 2 times [2022-07-20 21:02:58,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:02:58,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788139498] [2022-07-20 21:02:58,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:02:58,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:02:58,456 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 21:02:58,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [774886173] [2022-07-20 21:02:58,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 21:02:58,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:02:58,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:02:58,461 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:02:58,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-20 21:02:58,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 21:02:58,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:02:58,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 21:02:58,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:02:58,640 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 326 proven. 70 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2022-07-20 21:02:58,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:02:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2022-07-20 21:02:58,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:02:58,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788139498] [2022-07-20 21:02:58,706 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 21:02:58,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774886173] [2022-07-20 21:02:58,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774886173] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:02:58,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 21:02:58,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2022-07-20 21:02:58,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88582426] [2022-07-20 21:02:58,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 21:02:58,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 21:02:58,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:02:58,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 21:02:58,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-07-20 21:02:58,708 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-20 21:02:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:02:58,765 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2022-07-20 21:02:58,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 21:02:58,766 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 114 [2022-07-20 21:02:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:02:58,769 INFO L225 Difference]: With dead ends: 110 [2022-07-20 21:02:58,769 INFO L226 Difference]: Without dead ends: 72 [2022-07-20 21:02:58,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-07-20 21:02:58,773 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:02:58,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 98 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:02:58,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-20 21:02:58,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-07-20 21:02:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 67 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 21:02:58,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2022-07-20 21:02:58,789 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 114 [2022-07-20 21:02:58,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:02:58,793 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2022-07-20 21:02:58,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-20 21:02:58,793 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2022-07-20 21:02:58,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-20 21:02:58,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:02:58,804 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 18, 12, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:02:58,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-20 21:02:59,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:02:59,012 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:02:59,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:02:59,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1864872287, now seen corresponding path program 3 times [2022-07-20 21:02:59,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:02:59,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921731000] [2022-07-20 21:02:59,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:02:59,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:02:59,048 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 21:02:59,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1591591866] [2022-07-20 21:02:59,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 21:02:59,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:02:59,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:02:59,058 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:02:59,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 21:02:59,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-20 21:02:59,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:02:59,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 21:02:59,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:02:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1511 backedges. 650 proven. 1 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2022-07-20 21:02:59,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:02:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1511 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2022-07-20 21:02:59,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:02:59,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921731000] [2022-07-20 21:02:59,186 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 21:02:59,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591591866] [2022-07-20 21:02:59,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591591866] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:02:59,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 21:02:59,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-20 21:02:59,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556072083] [2022-07-20 21:02:59,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 21:02:59,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 21:02:59,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:02:59,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 21:02:59,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-20 21:02:59,188 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 21:02:59,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:02:59,206 INFO L93 Difference]: Finished difference Result 119 states and 136 transitions. [2022-07-20 21:02:59,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 21:02:59,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 141 [2022-07-20 21:02:59,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:02:59,208 INFO L225 Difference]: With dead ends: 119 [2022-07-20 21:02:59,208 INFO L226 Difference]: Without dead ends: 78 [2022-07-20 21:02:59,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-20 21:02:59,209 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:02:59,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 128 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:02:59,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-20 21:02:59,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-07-20 21:02:59,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 73 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 21:02:59,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2022-07-20 21:02:59,215 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 141 [2022-07-20 21:02:59,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:02:59,216 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2022-07-20 21:02:59,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 21:02:59,216 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2022-07-20 21:02:59,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-20 21:02:59,217 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:02:59,217 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 18, 12, 10, 10, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:02:59,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-20 21:02:59,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-20 21:02:59,424 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:02:59,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:02:59,424 INFO L85 PathProgramCache]: Analyzing trace with hash -105377125, now seen corresponding path program 4 times [2022-07-20 21:02:59,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:02:59,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582888139] [2022-07-20 21:02:59,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:02:59,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:02:59,447 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 21:02:59,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [209816787] [2022-07-20 21:02:59,448 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 21:02:59,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:02:59,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:02:59,449 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:02:59,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 21:02:59,574 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 21:02:59,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:02:59,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 21:02:59,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:02:59,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1526 backedges. 650 proven. 16 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2022-07-20 21:02:59,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:02:59,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1526 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2022-07-20 21:02:59,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:02:59,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582888139] [2022-07-20 21:02:59,692 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-20 21:02:59,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209816787] [2022-07-20 21:02:59,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209816787] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:02:59,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 21:02:59,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-07-20 21:02:59,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144482721] [2022-07-20 21:02:59,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 21:02:59,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 21:02:59,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:02:59,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 21:02:59,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-07-20 21:02:59,696 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 21:02:59,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:02:59,728 INFO L93 Difference]: Finished difference Result 129 states and 148 transitions. [2022-07-20 21:02:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 21:02:59,729 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 147 [2022-07-20 21:02:59,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:02:59,731 INFO L225 Difference]: With dead ends: 129 [2022-07-20 21:02:59,731 INFO L226 Difference]: Without dead ends: 88 [2022-07-20 21:02:59,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-07-20 21:02:59,734 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 9 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:02:59,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 78 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:02:59,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-20 21:02:59,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-20 21:02:59,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.0963855421686748) internal successors, (91), 83 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 21:02:59,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2022-07-20 21:02:59,748 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 147 [2022-07-20 21:02:59,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:02:59,749 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2022-07-20 21:02:59,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 21:02:59,749 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2022-07-20 21:02:59,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-20 21:02:59,751 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:02:59,751 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 18, 12, 10, 10, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:02:59,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-20 21:02:59,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-20 21:02:59,975 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:02:59,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:02:59,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1925080943, now seen corresponding path program 5 times [2022-07-20 21:02:59,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:02:59,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68683068] [2022-07-20 21:02:59,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:02:59,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:03:00,014 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-20 21:03:00,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [254027942] [2022-07-20 21:03:00,017 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 21:03:00,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:03:00,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:03:00,018 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:03:00,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 21:03:04,339 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2022-07-20 21:03:04,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-20 21:03:04,339 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 21:03:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 21:03:05,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-20 21:03:05,322 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 21:03:05,322 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-20 21:03:05,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-20 21:03:05,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-20 21:03:05,548 INFO L356 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1] [2022-07-20 21:03:05,551 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 21:03:05,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 09:03:05 BoogieIcfgContainer [2022-07-20 21:03:05,661 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 21:03:05,662 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 21:03:05,662 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 21:03:05,662 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 21:03:05,663 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:02:54" (3/4) ... [2022-07-20 21:03:05,664 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-20 21:03:05,776 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-20 21:03:05,779 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 21:03:05,780 INFO L158 Benchmark]: Toolchain (without parser) took 11648.18ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 58.7MB in the beginning and 52.0MB in the end (delta: 6.7MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2022-07-20 21:03:05,780 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 90.2MB. Free memory was 45.8MB in the beginning and 45.7MB in the end (delta: 45.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 21:03:05,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.18ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 58.7MB in the beginning and 83.8MB in the end (delta: -25.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-20 21:03:05,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.81ms. Allocated memory is still 109.1MB. Free memory was 83.8MB in the beginning and 82.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 21:03:05,781 INFO L158 Benchmark]: Boogie Preprocessor took 47.38ms. Allocated memory is still 109.1MB. Free memory was 82.3MB in the beginning and 80.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 21:03:05,781 INFO L158 Benchmark]: RCFGBuilder took 385.89ms. Allocated memory is still 109.1MB. Free memory was 80.7MB in the beginning and 69.7MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-20 21:03:05,782 INFO L158 Benchmark]: TraceAbstraction took 10735.05ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 69.2MB in the beginning and 60.3MB in the end (delta: 8.8MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2022-07-20 21:03:05,782 INFO L158 Benchmark]: Witness Printer took 117.36ms. Allocated memory is still 132.1MB. Free memory was 60.3MB in the beginning and 52.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-20 21:03:05,783 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 90.2MB. Free memory was 45.8MB in the beginning and 45.7MB in the end (delta: 45.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.18ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 58.7MB in the beginning and 83.8MB in the end (delta: -25.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.81ms. Allocated memory is still 109.1MB. Free memory was 83.8MB in the beginning and 82.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.38ms. Allocated memory is still 109.1MB. Free memory was 82.3MB in the beginning and 80.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 385.89ms. Allocated memory is still 109.1MB. Free memory was 80.7MB in the beginning and 69.7MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10735.05ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 69.2MB in the beginning and 60.3MB in the end (delta: 8.8MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * Witness Printer took 117.36ms. Allocated memory is still 132.1MB. Free memory was 60.3MB in the beginning and 52.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 61]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int x[10]; [L43] CALL init_nondet(x) [L16] int i; [L17] i = 0 VAL [i=0, x={3:0}, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={3:0}, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={3:0}, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={3:0}, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={3:0}, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={3:0}, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=6, x={3:0}, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=7, x={3:0}, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=8, x={3:0}, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=9, x={3:0}, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=10, x={3:0}, x={3:0}] [L17] COND FALSE !(i < 10) VAL [i=10, x={3:0}, x={3:0}] [L43] RET init_nondet(x) [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={3:0}] [L49] CALL, EXPR rangesum(x) VAL [x={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=6, ret=-7, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=1, i=7, ret=-7, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=1, i=7, ret=-7, x={3:0}, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=7, ret=-13, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=2, i=8, ret=-13, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=2, i=8, ret=-13, x={3:0}, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=3, i=8, ret=-11, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=3, i=9, ret=-11, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=3, i=9, ret=-11, x={3:0}, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=4, i=9, ret=-8, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=4, i=10, ret=-8, x={3:0}, x={3:0}] [L28] COND FALSE !(i < 10) VAL [cnt=4, i=10, ret=-8, x={3:0}, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=-2, cnt=4, i=10, ret=-8, x={3:0}, x={3:0}] [L49] RET, EXPR rangesum(x) VAL [rangesum(x)=-2, x={3:0}] [L49] ret = rangesum(x) [L51] EXPR x[0] [L51] temp=x[0] [L51] EXPR x[1] [L51] x[0] = x[1] [L51] x[1] = temp VAL [ret=-2, temp=-2147483648, x={3:0}] [L52] CALL, EXPR rangesum(x) VAL [x={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=6, ret=-7, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=1, i=7, ret=-7, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=1, i=7, ret=-7, x={3:0}, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=7, ret=-13, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=2, i=8, ret=-13, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=2, i=8, ret=-13, x={3:0}, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=3, i=8, ret=-11, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=3, i=9, ret=-11, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=3, i=9, ret=-11, x={3:0}, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=4, i=9, ret=-8, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=4, i=10, ret=-8, x={3:0}, x={3:0}] [L28] COND FALSE !(i < 10) VAL [cnt=4, i=10, ret=-8, x={3:0}, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=-2, cnt=4, i=10, ret=-8, x={3:0}, x={3:0}] [L52] RET, EXPR rangesum(x) VAL [rangesum(x)=-2, ret=-2, temp=-2147483648, x={3:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret=-2, ret2=-2, temp=-2147483647, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret=-2, ret2=-2, temp=-2147483647, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret=-2, ret2=-2, temp=-2147483647, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret=-2, ret2=-2, temp=-2147483647, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret=-2, ret2=-2, temp=-2147483647, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=5, ret=-2, ret2=-2, temp=-2147483647, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=6, ret=-2, ret2=-2, temp=-2147483647, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=7, ret=-2, ret2=-2, temp=-2147483647, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=8, ret=-2, ret2=-2, temp=-2147483647, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=9, ret=-2, ret2=-2, temp=-2147483647, x={3:0}] [L54] COND FALSE !(i<10 -1) VAL [i=9, ret=-2, ret2=-2, temp=-2147483647, x={3:0}] [L57] x[10 -1] = temp VAL [i=9, ret=-2, ret2=-2, temp=-2147483647, x={3:0}] [L58] CALL, EXPR rangesum(x) VAL [x={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=6, ret=-6, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=1, i=7, ret=-6, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=1, i=7, ret=-6, x={3:0}, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=7, ret=-4, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=2, i=8, ret=-4, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=2, i=8, ret=-4, x={3:0}, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=3, i=8, ret=-1, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=3, i=9, ret=-1, x={3:0}, x={3:0}] [L28] COND TRUE i < 10 VAL [cnt=3, i=9, ret=-1, x={3:0}, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=4, i=9, ret=-2147483648, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=4, i=10, ret=-2147483648, x={3:0}, x={3:0}] [L28] COND FALSE !(i < 10) VAL [cnt=4, i=10, ret=-2147483648, x={3:0}, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=-536870912, cnt=4, i=10, ret=-2147483648, x={3:0}, x={3:0}] [L58] RET, EXPR rangesum(x) VAL [i=9, rangesum(x)=-536870912, ret=-2, ret2=-2, temp=-2147483647, x={3:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [i=9, ret=-2, ret2=-2, ret5=-536870912, temp=-2147483647, x={3:0}] [L61] reach_error() VAL [i=9, ret=-2, ret2=-2, ret5=-536870912, temp=-2147483647, x={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 11, TraceHistogramMax: 30, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 897 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 624 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 214 IncrementalHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 273 mSDtfsCounter, 214 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1306 GetRequests, 1246 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=10, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 11 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1090 NumberOfCodeBlocks, 986 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1381 ConstructedInterpolants, 0 QuantifiedInterpolants, 1633 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2098 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 8022/8684 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-20 21:03:05,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE