./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 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/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 ac50e78a0e7740f8f8502d719fb62ad334aab86379189891d467b39f2a3c9d3d --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 11:03:04,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 11:03:04,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 11:03:04,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 11:03:04,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 11:03:04,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 11:03:04,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 11:03:04,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 11:03:04,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 11:03:04,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 11:03:04,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 11:03:04,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 11:03:04,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 11:03:04,773 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 11:03:04,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 11:03:04,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 11:03:04,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 11:03:04,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 11:03:04,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 11:03:04,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 11:03:04,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 11:03:04,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 11:03:04,786 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 11:03:04,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 11:03:04,792 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 11:03:04,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 11:03:04,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 11:03:04,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 11:03:04,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 11:03:04,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 11:03:04,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 11:03:04,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 11:03:04,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 11:03:04,802 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 11:03:04,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 11:03:04,803 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 11:03:04,804 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 11:03:04,804 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 11:03:04,804 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 11:03:04,805 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 11:03:04,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 11:03:04,808 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 11:03:04,830 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 11:03:04,831 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 11:03:04,831 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 11:03:04,831 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 11:03:04,832 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 11:03:04,832 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 11:03:04,833 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 11:03:04,833 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 11:03:04,833 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 11:03:04,833 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 11:03:04,834 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 11:03:04,834 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 11:03:04,834 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 11:03:04,834 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 11:03:04,835 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 11:03:04,835 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 11:03:04,835 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 11:03:04,835 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 11:03:04,835 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 11:03:04,835 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 11:03:04,836 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 11:03:04,836 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 11:03:04,836 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 11:03:04,836 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 11:03:04,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 11:03:04,837 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 11:03:04,837 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 11:03:04,837 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 11:03:04,837 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 11:03:04,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 11:03:04,838 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 11:03:04,838 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 11:03:04,838 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 11:03:04,838 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 11:03:04,838 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 11:03:04,839 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.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 -> ac50e78a0e7740f8f8502d719fb62ad334aab86379189891d467b39f2a3c9d3d [2023-02-15 11:03:05,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 11:03:05,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 11:03:05,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 11:03:05,095 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 11:03:05,095 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 11:03:05,096 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2023-02-15 11:03:06,203 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 11:03:06,366 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 11:03:06,366 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2023-02-15 11:03:06,371 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/779dea430/ea1f7fcfb3b6472cbb49480e766b8e16/FLAG2c482360c [2023-02-15 11:03:06,381 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/779dea430/ea1f7fcfb3b6472cbb49480e766b8e16 [2023-02-15 11:03:06,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 11:03:06,384 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 11:03:06,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 11:03:06,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 11:03:06,393 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 11:03:06,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:03:06" (1/1) ... [2023-02-15 11:03:06,394 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78b34572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:06, skipping insertion in model container [2023-02-15 11:03:06,394 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:03:06" (1/1) ... [2023-02-15 11:03:06,400 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 11:03:06,415 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 11:03:06,527 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1215,1228] [2023-02-15 11:03:06,534 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1969,1982] [2023-02-15 11:03:06,536 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[2504,2517] [2023-02-15 11:03:06,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 11:03:06,545 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 11:03:06,558 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1215,1228] [2023-02-15 11:03:06,561 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1969,1982] [2023-02-15 11:03:06,564 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[2504,2517] [2023-02-15 11:03:06,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 11:03:06,577 INFO L208 MainTranslator]: Completed translation [2023-02-15 11:03:06,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:06 WrapperNode [2023-02-15 11:03:06,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 11:03:06,579 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 11:03:06,579 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 11:03:06,579 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 11:03:06,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:06" (1/1) ... [2023-02-15 11:03:06,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:06" (1/1) ... [2023-02-15 11:03:06,607 INFO L138 Inliner]: procedures = 15, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 134 [2023-02-15 11:03:06,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 11:03:06,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 11:03:06,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 11:03:06,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 11:03:06,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:06" (1/1) ... [2023-02-15 11:03:06,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:06" (1/1) ... [2023-02-15 11:03:06,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:06" (1/1) ... [2023-02-15 11:03:06,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:06" (1/1) ... [2023-02-15 11:03:06,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:06" (1/1) ... [2023-02-15 11:03:06,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:06" (1/1) ... [2023-02-15 11:03:06,673 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:06" (1/1) ... [2023-02-15 11:03:06,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:06" (1/1) ... [2023-02-15 11:03:06,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 11:03:06,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 11:03:06,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 11:03:06,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 11:03:06,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:06" (1/1) ... [2023-02-15 11:03:06,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 11:03:06,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:03:06,702 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) [2023-02-15 11:03:06,703 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 [2023-02-15 11:03:06,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 11:03:06,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 11:03:06,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 11:03:06,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 11:03:06,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 11:03:06,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 11:03:06,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 11:03:06,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 11:03:06,821 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 11:03:06,823 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 11:03:07,051 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 11:03:07,056 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 11:03:07,056 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 11:03:07,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:03:07 BoogieIcfgContainer [2023-02-15 11:03:07,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 11:03:07,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 11:03:07,059 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 11:03:07,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 11:03:07,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 11:03:06" (1/3) ... [2023-02-15 11:03:07,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26955b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:03:07, skipping insertion in model container [2023-02-15 11:03:07,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:06" (2/3) ... [2023-02-15 11:03:07,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26955b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:03:07, skipping insertion in model container [2023-02-15 11:03:07,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:03:07" (3/3) ... [2023-02-15 11:03:07,064 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+nlh-reducer.c [2023-02-15 11:03:07,077 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 11:03:07,077 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-02-15 11:03:07,117 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 11:03:07,136 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@766b71a1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 11:03:07,152 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-02-15 11:03:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 33 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:07,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 11:03:07,160 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:03:07,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:03:07,161 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:03:07,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:03:07,164 INFO L85 PathProgramCache]: Analyzing trace with hash 685537565, now seen corresponding path program 1 times [2023-02-15 11:03:07,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:03:07,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508506975] [2023-02-15 11:03:07,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:03:07,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:03:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:03:07,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:03:07,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:03:07,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508506975] [2023-02-15 11:03:07,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508506975] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:03:07,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:03:07,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 11:03:07,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666766489] [2023-02-15 11:03:07,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:03:07,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 11:03:07,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:03:07,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 11:03:07,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 11:03:07,425 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 33 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:07,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:03:07,449 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2023-02-15 11:03:07,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 11:03:07,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-15 11:03:07,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:03:07,466 INFO L225 Difference]: With dead ends: 66 [2023-02-15 11:03:07,466 INFO L226 Difference]: Without dead ends: 32 [2023-02-15 11:03:07,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 11:03:07,476 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 84 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 [2023-02-15 11:03:07,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 84 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:03:07,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-15 11:03:07,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-02-15 11:03:07,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:07,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2023-02-15 11:03:07,504 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 11 [2023-02-15 11:03:07,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:03:07,504 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-02-15 11:03:07,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:07,504 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2023-02-15 11:03:07,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 11:03:07,505 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:03:07,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:03:07,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 11:03:07,506 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:03:07,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:03:07,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1849249499, now seen corresponding path program 1 times [2023-02-15 11:03:07,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:03:07,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826145643] [2023-02-15 11:03:07,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:03:07,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:03:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:03:07,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:03:07,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:03:07,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826145643] [2023-02-15 11:03:07,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826145643] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 11:03:07,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553487479] [2023-02-15 11:03:07,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:03:07,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:03:07,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:03:07,665 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) [2023-02-15 11:03:07,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 11:03:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:03:07,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 11:03:07,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:03:07,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 11:03:07,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 11:03:07,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553487479] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:03:07,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 11:03:07,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-02-15 11:03:07,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955745403] [2023-02-15 11:03:07,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:03:07,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 11:03:07,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:03:07,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 11:03:07,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 11:03:07,815 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:07,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:03:07,833 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2023-02-15 11:03:07,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 11:03:07,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-15 11:03:07,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:03:07,834 INFO L225 Difference]: With dead ends: 38 [2023-02-15 11:03:07,834 INFO L226 Difference]: Without dead ends: 33 [2023-02-15 11:03:07,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 11:03:07,836 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:03:07,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 54 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:03:07,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-15 11:03:07,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2023-02-15 11:03:07,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:07,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-02-15 11:03:07,841 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 13 [2023-02-15 11:03:07,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:03:07,842 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-02-15 11:03:07,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:07,842 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-02-15 11:03:07,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 11:03:07,843 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:03:07,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:03:07,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 11:03:08,048 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 [2023-02-15 11:03:08,049 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:03:08,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:03:08,050 INFO L85 PathProgramCache]: Analyzing trace with hash -688679461, now seen corresponding path program 1 times [2023-02-15 11:03:08,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:03:08,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135004744] [2023-02-15 11:03:08,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:03:08,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:03:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:03:08,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 11:03:08,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:03:08,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135004744] [2023-02-15 11:03:08,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135004744] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:03:08,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:03:08,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 11:03:08,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775271256] [2023-02-15 11:03:08,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:03:08,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 11:03:08,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:03:08,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 11:03:08,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 11:03:08,131 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:08,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:03:08,161 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2023-02-15 11:03:08,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 11:03:08,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-15 11:03:08,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:03:08,163 INFO L225 Difference]: With dead ends: 58 [2023-02-15 11:03:08,163 INFO L226 Difference]: Without dead ends: 38 [2023-02-15 11:03:08,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 11:03:08,165 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:03:08,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 44 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:03:08,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-15 11:03:08,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2023-02-15 11:03:08,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-02-15 11:03:08,172 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 14 [2023-02-15 11:03:08,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:03:08,173 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-02-15 11:03:08,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-02-15 11:03:08,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 11:03:08,174 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:03:08,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:03:08,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 11:03:08,175 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:03:08,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:03:08,176 INFO L85 PathProgramCache]: Analyzing trace with hash -757168970, now seen corresponding path program 1 times [2023-02-15 11:03:08,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:03:08,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70554219] [2023-02-15 11:03:08,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:03:08,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:03:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:03:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 11:03:08,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:03:08,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70554219] [2023-02-15 11:03:08,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70554219] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:03:08,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:03:08,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 11:03:08,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886639800] [2023-02-15 11:03:08,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:03:08,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 11:03:08,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:03:08,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 11:03:08,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 11:03:08,271 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:08,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:03:08,316 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2023-02-15 11:03:08,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 11:03:08,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-15 11:03:08,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:03:08,320 INFO L225 Difference]: With dead ends: 51 [2023-02-15 11:03:08,324 INFO L226 Difference]: Without dead ends: 49 [2023-02-15 11:03:08,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 11:03:08,328 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 22 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:03:08,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 92 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:03:08,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-02-15 11:03:08,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2023-02-15 11:03:08,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2023-02-15 11:03:08,340 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2023-02-15 11:03:08,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:03:08,341 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2023-02-15 11:03:08,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:08,341 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2023-02-15 11:03:08,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 11:03:08,342 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:03:08,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:03:08,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 11:03:08,342 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:03:08,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:03:08,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1935439187, now seen corresponding path program 1 times [2023-02-15 11:03:08,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:03:08,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361040883] [2023-02-15 11:03:08,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:03:08,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:03:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:03:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 11:03:08,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:03:08,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361040883] [2023-02-15 11:03:08,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361040883] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:03:08,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:03:08,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 11:03:08,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445442160] [2023-02-15 11:03:08,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:03:08,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 11:03:08,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:03:08,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 11:03:08,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 11:03:08,383 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:08,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:03:08,414 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2023-02-15 11:03:08,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 11:03:08,414 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-15 11:03:08,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:03:08,418 INFO L225 Difference]: With dead ends: 54 [2023-02-15 11:03:08,419 INFO L226 Difference]: Without dead ends: 34 [2023-02-15 11:03:08,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 11:03:08,421 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:03:08,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 42 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:03:08,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-15 11:03:08,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2023-02-15 11:03:08,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:08,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-02-15 11:03:08,430 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2023-02-15 11:03:08,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:03:08,430 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-02-15 11:03:08,431 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:08,431 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-02-15 11:03:08,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 11:03:08,431 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:03:08,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:03:08,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 11:03:08,432 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:03:08,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:03:08,435 INFO L85 PathProgramCache]: Analyzing trace with hash -9215146, now seen corresponding path program 1 times [2023-02-15 11:03:08,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:03:08,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118392978] [2023-02-15 11:03:08,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:03:08,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:03:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:03:08,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:03:08,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:03:08,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118392978] [2023-02-15 11:03:08,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118392978] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 11:03:08,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451191420] [2023-02-15 11:03:08,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:03:08,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:03:08,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:03:08,574 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) [2023-02-15 11:03:08,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 11:03:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:03:08,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 11:03:08,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:03:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:03:08,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:03:08,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:03:08,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451191420] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:03:08,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 11:03:08,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-15 11:03:08,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501628903] [2023-02-15 11:03:08,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 11:03:08,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 11:03:08,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:03:08,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 11:03:08,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-02-15 11:03:08,699 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:08,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:03:08,736 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2023-02-15 11:03:08,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 11:03:08,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-15 11:03:08,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:03:08,741 INFO L225 Difference]: With dead ends: 57 [2023-02-15 11:03:08,741 INFO L226 Difference]: Without dead ends: 34 [2023-02-15 11:03:08,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2023-02-15 11:03:08,745 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 3 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:03:08,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 83 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:03:08,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-15 11:03:08,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-02-15 11:03:08,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.1875) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2023-02-15 11:03:08,754 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 20 [2023-02-15 11:03:08,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:03:08,755 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2023-02-15 11:03:08,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:08,755 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2023-02-15 11:03:08,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 11:03:08,756 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:03:08,756 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:03:08,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 11:03:08,962 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,SelfDestructingSolverStorable5 [2023-02-15 11:03:08,962 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:03:08,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:03:08,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1951259100, now seen corresponding path program 2 times [2023-02-15 11:03:08,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:03:08,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476325308] [2023-02-15 11:03:08,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:03:08,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:03:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:03:09,136 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 11:03:09,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:03:09,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476325308] [2023-02-15 11:03:09,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476325308] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 11:03:09,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385079081] [2023-02-15 11:03:09,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 11:03:09,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:03:09,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:03:09,138 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) [2023-02-15 11:03:09,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 11:03:09,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 11:03:09,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 11:03:09,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-15 11:03:09,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:03:09,789 INFO L321 Elim1Store]: treesize reduction 120, result has 5.5 percent of original size [2023-02-15 11:03:09,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 356 treesize of output 156 [2023-02-15 11:03:09,918 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 11:03:09,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 11:03:09,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385079081] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:03:09,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 11:03:09,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2023-02-15 11:03:09,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749758455] [2023-02-15 11:03:09,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:03:09,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 11:03:09,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:03:09,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 11:03:09,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-02-15 11:03:09,920 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:10,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:03:10,214 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2023-02-15 11:03:10,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 11:03:10,215 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-15 11:03:10,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:03:10,216 INFO L225 Difference]: With dead ends: 49 [2023-02-15 11:03:10,216 INFO L226 Difference]: Without dead ends: 30 [2023-02-15 11:03:10,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2023-02-15 11:03:10,217 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 11:03:10,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 43 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 11:03:10,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-15 11:03:10,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2023-02-15 11:03:10,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2023-02-15 11:03:10,222 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2023-02-15 11:03:10,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:03:10,224 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2023-02-15 11:03:10,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:10,225 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2023-02-15 11:03:10,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 11:03:10,225 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:03:10,226 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:03:10,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 11:03:10,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:03:10,434 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:03:10,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:03:10,434 INFO L85 PathProgramCache]: Analyzing trace with hash -321915466, now seen corresponding path program 1 times [2023-02-15 11:03:10,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:03:10,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028864427] [2023-02-15 11:03:10,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:03:10,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:03:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:03:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 11:03:10,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:03:10,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028864427] [2023-02-15 11:03:10,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028864427] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:03:10,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:03:10,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 11:03:10,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488446020] [2023-02-15 11:03:10,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:03:10,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 11:03:10,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:03:10,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 11:03:10,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 11:03:10,539 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:10,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:03:10,582 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2023-02-15 11:03:10,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 11:03:10,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-15 11:03:10,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:03:10,583 INFO L225 Difference]: With dead ends: 34 [2023-02-15 11:03:10,583 INFO L226 Difference]: Without dead ends: 0 [2023-02-15 11:03:10,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-02-15 11:03:10,585 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:03:10,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 76 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:03:10,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-15 11:03:10,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-15 11:03:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-15 11:03:10,587 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2023-02-15 11:03:10,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:03:10,587 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 11:03:10,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 11:03:10,587 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-15 11:03:10,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-15 11:03:10,590 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-02-15 11:03:10,590 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-02-15 11:03:10,590 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-02-15 11:03:10,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 11:03:10,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-15 11:03:10,822 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 97) no Hoare annotation was computed. [2023-02-15 11:03:10,822 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 77) no Hoare annotation was computed. [2023-02-15 11:03:10,822 INFO L895 garLoopResultBuilder]: At program point L89(lines 64 97) the Hoare annotation is: false [2023-02-15 11:03:10,822 INFO L895 garLoopResultBuilder]: At program point L52(lines 50 143) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 1))) (let ((.cse0 (let ((.cse7 (mod |ULTIMATE.start_main_~main__index2~0#1| 4294967296))) (let ((.cse3 (< (mod |ULTIMATE.start_main_~main__index1~0#1| 4294967296) .cse7))) (or (let ((.cse4 (mod (+ 4294967295 |ULTIMATE.start_main_~main__index1~0#1|) 4294967296)) (.cse5 (mod (+ |ULTIMATE.start_main_~main__index2~0#1| 1) 4294967296))) (and .cse3 (< .cse4 .cse5) (< .cse5 100000) (let ((.cse6 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0#1.base|))) (= (mod (select .cse6 (+ (* 4 .cse4) |ULTIMATE.start_main_~#main__array~0#1.offset|)) 4294967296) (mod (select .cse6 (+ (* .cse5 4) |ULTIMATE.start_main_~#main__array~0#1.offset|)) 4294967296))))) (and .cse3 (< .cse7 100000) .cse1))))) (.cse2 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 1))) (or (and .cse0 .cse1 .cse2) (and (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0)) .cse0 (not (= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~1#1| 0)) .cse2)))) [2023-02-15 11:03:10,822 INFO L899 garLoopResultBuilder]: For program point L114(line 114) no Hoare annotation was computed. [2023-02-15 11:03:10,822 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-02-15 11:03:10,822 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 143) no Hoare annotation was computed. [2023-02-15 11:03:10,822 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 14 172) the Hoare annotation is: true [2023-02-15 11:03:10,823 INFO L895 garLoopResultBuilder]: At program point $Ultimate##32(lines 105 131) the Hoare annotation is: (or (let ((.cse0 (mod |ULTIMATE.start_main_~main__index2~0#1| 4294967296))) (and (< (mod |ULTIMATE.start_main_~main__index1~0#1| 4294967296) .cse0) (< .cse0 100000) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1))) (let ((.cse1 (mod (+ 4294967295 |ULTIMATE.start_main_~main__index1~0#1|) 4294967296)) (.cse2 (mod (+ |ULTIMATE.start_main_~main__index2~0#1| 1) 4294967296))) (and (< .cse1 .cse2) (< .cse2 100000) (let ((.cse3 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0#1.base|))) (= (mod (select .cse3 (+ (* 4 .cse1) |ULTIMATE.start_main_~#main__array~0#1.offset|)) 4294967296) (mod (select .cse3 (+ (* .cse2 4) |ULTIMATE.start_main_~#main__array~0#1.offset|)) 4294967296)))))) [2023-02-15 11:03:10,823 INFO L895 garLoopResultBuilder]: At program point $Ultimate##30(lines 102 136) the Hoare annotation is: (or (= |ULTIMATE.start_main_~main__loop_entered~0#1| 0) (let ((.cse0 (mod (+ 4294967295 |ULTIMATE.start_main_~main__index1~0#1|) 4294967296)) (.cse1 (mod (+ |ULTIMATE.start_main_~main__index2~0#1| 1) 4294967296))) (and (< .cse0 .cse1) (< .cse1 100000) (let ((.cse2 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0#1.base|))) (= (mod (select .cse2 (+ (* 4 .cse0) |ULTIMATE.start_main_~#main__array~0#1.offset|)) 4294967296) (mod (select .cse2 (+ (* .cse1 4) |ULTIMATE.start_main_~#main__array~0#1.offset|)) 4294967296)))))) [2023-02-15 11:03:10,823 INFO L895 garLoopResultBuilder]: At program point L69(lines 66 92) the Hoare annotation is: (let ((.cse0 (mod (+ 4294967295 |ULTIMATE.start_main_~main__index1~0#1|) 4294967296)) (.cse1 (mod (+ |ULTIMATE.start_main_~main__index2~0#1| 1) 4294967296))) (and (< (mod |ULTIMATE.start_main_~main__index1~0#1| 4294967296) (mod |ULTIMATE.start_main_~main__index2~0#1| 4294967296)) (< .cse0 .cse1) (< .cse1 100000) (let ((.cse2 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0#1.base|))) (= (mod (select .cse2 (+ (* 4 .cse0) |ULTIMATE.start_main_~#main__array~0#1.offset|)) 4294967296) (mod (select .cse2 (+ (* .cse1 4) |ULTIMATE.start_main_~#main__array~0#1.offset|)) 4294967296))) (not (= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~1#1| 0)) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 1))) [2023-02-15 11:03:10,823 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-15 11:03:10,823 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 137) no Hoare annotation was computed. [2023-02-15 11:03:10,823 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-15 11:03:10,823 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 166) no Hoare annotation was computed. [2023-02-15 11:03:10,823 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 46) no Hoare annotation was computed. [2023-02-15 11:03:10,823 INFO L895 garLoopResultBuilder]: At program point L148(lines 33 156) the Hoare annotation is: false [2023-02-15 11:03:10,823 INFO L899 garLoopResultBuilder]: For program point L20-2(lines 20 23) no Hoare annotation was computed. [2023-02-15 11:03:10,823 INFO L895 garLoopResultBuilder]: At program point L20-3(lines 20 23) the Hoare annotation is: (= |ULTIMATE.start_main_~main__loop_entered~0#1| 0) [2023-02-15 11:03:10,823 INFO L899 garLoopResultBuilder]: For program point L20-4(lines 20 23) no Hoare annotation was computed. [2023-02-15 11:03:10,824 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 92) no Hoare annotation was computed. [2023-02-15 11:03:10,824 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 156) no Hoare annotation was computed. [2023-02-15 11:03:10,824 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-15 11:03:10,824 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 171) no Hoare annotation was computed. [2023-02-15 11:03:10,824 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 142) no Hoare annotation was computed. [2023-02-15 11:03:10,824 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 124) no Hoare annotation was computed. [2023-02-15 11:03:10,824 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2023-02-15 11:03:10,824 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 84) no Hoare annotation was computed. [2023-02-15 11:03:10,824 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-15 11:03:10,824 INFO L895 garLoopResultBuilder]: At program point L38(lines 35 151) the Hoare annotation is: (and (= |ULTIMATE.start_main_~main__loop_entered~0#1| 0) (< (mod |ULTIMATE.start_main_~main__index1~0#1| 4294967296) (mod |ULTIMATE.start_main_~main__index2~0#1| 4294967296)) (<= |ULTIMATE.start_main_~main__index2~0#1| (+ 99999 (* (div |ULTIMATE.start_main_~main__index2~0#1| 4294967296) 4294967296))) (= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 1)) [2023-02-15 11:03:10,824 INFO L902 garLoopResultBuilder]: At program point L129(lines 102 136) the Hoare annotation is: true [2023-02-15 11:03:10,824 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 161) no Hoare annotation was computed. [2023-02-15 11:03:10,824 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 114) no Hoare annotation was computed. [2023-02-15 11:03:10,824 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 151) no Hoare annotation was computed. [2023-02-15 11:03:10,827 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2023-02-15 11:03:10,831 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 11:03:10,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 11:03:10 BoogieIcfgContainer [2023-02-15 11:03:10,865 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 11:03:10,866 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 11:03:10,867 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 11:03:10,868 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 11:03:10,868 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:03:07" (3/4) ... [2023-02-15 11:03:10,870 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-15 11:03:10,882 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-02-15 11:03:10,883 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-15 11:03:10,883 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-15 11:03:10,883 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-15 11:03:10,927 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 11:03:10,927 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 11:03:10,927 INFO L158 Benchmark]: Toolchain (without parser) took 4542.83ms. Allocated memory was 117.4MB in the beginning and 182.5MB in the end (delta: 65.0MB). Free memory was 79.0MB in the beginning and 105.7MB in the end (delta: -26.7MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. [2023-02-15 11:03:10,928 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 90.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 11:03:10,928 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.65ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 66.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 11:03:10,928 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.79ms. Allocated memory is still 117.4MB. Free memory was 66.9MB in the beginning and 65.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 11:03:10,929 INFO L158 Benchmark]: Boogie Preprocessor took 70.63ms. Allocated memory is still 117.4MB. Free memory was 65.3MB in the beginning and 90.3MB in the end (delta: -25.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 11:03:10,929 INFO L158 Benchmark]: RCFGBuilder took 378.18ms. Allocated memory is still 117.4MB. Free memory was 90.3MB in the beginning and 75.8MB in the end (delta: 14.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 11:03:10,929 INFO L158 Benchmark]: TraceAbstraction took 3806.18ms. Allocated memory was 117.4MB in the beginning and 182.5MB in the end (delta: 65.0MB). Free memory was 75.2MB in the beginning and 108.9MB in the end (delta: -33.7MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2023-02-15 11:03:10,930 INFO L158 Benchmark]: Witness Printer took 61.22ms. Allocated memory is still 182.5MB. Free memory was 108.9MB in the beginning and 105.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 11:03:10,931 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.17ms. Allocated memory is still 117.4MB. Free memory is still 90.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.65ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 66.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.79ms. Allocated memory is still 117.4MB. Free memory was 66.9MB in the beginning and 65.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.63ms. Allocated memory is still 117.4MB. Free memory was 65.3MB in the beginning and 90.3MB in the end (delta: -25.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 378.18ms. Allocated memory is still 117.4MB. Free memory was 90.3MB in the beginning and 75.8MB in the end (delta: 14.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3806.18ms. Allocated memory was 117.4MB in the beginning and 182.5MB in the end (delta: 65.0MB). Free memory was 75.2MB in the beginning and 108.9MB in the end (delta: -33.7MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. * Witness Printer took 61.22ms. Allocated memory is still 182.5MB. Free memory was 108.9MB in the beginning and 105.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 46]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 77]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 114]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 518 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 283 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 161 IncrementalHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 235 mSDtfsCounter, 161 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, InterpolantAutomatonStates: 44, 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, 8 MinimizatonAttempts, 34 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 25 NumberOfFragments, 383 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 129 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 199 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 657 SizeOfPredicates, 13 NumberOfNonLiveVariables, 266 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 36/56 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 - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: main__loop_entered == 0 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: main__loop_entered == 0 || (((4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296 && (main__index2 + 1) % 4294967296 < 100000) && unknown-#memory_int-unknown[main__array][4 * ((4294967295 + main__index1) % 4294967296) + main__array] % 4294967296 == unknown-#memory_int-unknown[main__array][(main__index2 + 1) % 4294967296 * 4 + main__array] % 4294967296) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((main__loop_entered == 0 && main__index1 % 4294967296 < main__index2 % 4294967296) && main__index2 <= 99999 + main__index2 / 4294967296 * 4294967296) && main____CPAchecker_TMP_0 == 1 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: ((((((main__index1 % 4294967296 < main__index2 % 4294967296 && (4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296) && (main__index2 + 1) % 4294967296 < 100000) && unknown-#memory_int-unknown[main__array][4 * ((4294967295 + main__index1) % 4294967296) + main__array] % 4294967296 == unknown-#memory_int-unknown[main__array][(main__index2 + 1) % 4294967296 * 4 + main__array] % 4294967296) || ((main__index1 % 4294967296 < main__index2 % 4294967296 && main__index2 % 4294967296 < 100000) && main____CPAchecker_TMP_0 == 1)) && main____CPAchecker_TMP_0 == 1) && __VERIFIER_assert__cond == 1) || (((!(__VERIFIER_assert__cond == 0) && ((((main__index1 % 4294967296 < main__index2 % 4294967296 && (4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296) && (main__index2 + 1) % 4294967296 < 100000) && unknown-#memory_int-unknown[main__array][4 * ((4294967295 + main__index1) % 4294967296) + main__array] % 4294967296 == unknown-#memory_int-unknown[main__array][(main__index2 + 1) % 4294967296 * 4 + main__array] % 4294967296) || ((main__index1 % 4294967296 < main__index2 % 4294967296 && main__index2 % 4294967296 < 100000) && main____CPAchecker_TMP_0 == 1))) && !(main____CPAchecker_TMP_0 == 0)) && __VERIFIER_assert__cond == 1) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: ((((main__index1 % 4294967296 < main__index2 % 4294967296 && (4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296) && (main__index2 + 1) % 4294967296 < 100000) && unknown-#memory_int-unknown[main__array][4 * ((4294967295 + main__index1) % 4294967296) + main__array] % 4294967296 == unknown-#memory_int-unknown[main__array][(main__index2 + 1) % 4294967296 * 4 + main__array] % 4294967296) && !(main____CPAchecker_TMP_0 == 0)) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((main__index1 % 4294967296 < main__index2 % 4294967296 && main__index2 % 4294967296 < 100000) && __VERIFIER_assert__cond == 1) || (((4294967295 + main__index1) % 4294967296 < (main__index2 + 1) % 4294967296 && (main__index2 + 1) % 4294967296 < 100000) && unknown-#memory_int-unknown[main__array][4 * ((4294967295 + main__index1) % 4294967296) + main__array] % 4294967296 == unknown-#memory_int-unknown[main__array][(main__index2 + 1) % 4294967296 * 4 + main__array] % 4294967296) RESULT: Ultimate proved your program to be correct! [2023-02-15 11:03:10,949 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 Result: TRUE