./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/invert_string-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5317dae 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/loops/invert_string-1.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 b3da85103e65fd13a584e838d8b961878044a0a70e09ad1788e3ca53a404f357 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 01:15:30,703 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 01:15:30,705 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 01:15:30,728 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 01:15:30,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 01:15:30,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 01:15:30,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 01:15:30,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 01:15:30,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 01:15:30,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 01:15:30,742 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 01:15:30,743 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 01:15:30,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 01:15:30,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 01:15:30,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 01:15:30,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 01:15:30,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 01:15:30,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 01:15:30,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 01:15:30,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 01:15:30,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 01:15:30,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 01:15:30,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 01:15:30,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 01:15:30,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 01:15:30,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 01:15:30,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 01:15:30,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 01:15:30,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 01:15:30,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 01:15:30,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 01:15:30,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 01:15:30,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 01:15:30,771 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 01:15:30,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 01:15:30,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 01:15:30,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 01:15:30,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 01:15:30,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 01:15:30,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 01:15:30,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 01:15:30,776 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 01:15:30,790 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 01:15:30,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 01:15:30,791 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 01:15:30,791 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 01:15:30,792 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 01:15:30,792 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 01:15:30,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 01:15:30,793 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 01:15:30,793 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 01:15:30,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 01:15:30,793 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 01:15:30,794 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 01:15:30,794 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 01:15:30,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 01:15:30,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 01:15:30,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 01:15:30,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 01:15:30,794 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 01:15:30,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 01:15:30,795 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 01:15:30,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 01:15:30,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 01:15:30,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 01:15:30,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 01:15:30,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 01:15:30,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 01:15:30,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 01:15:30,796 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 01:15:30,796 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 01:15:30,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 01:15:30,796 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 01:15:30,796 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 01:15:30,797 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 01:15:30,797 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 01:15:30,797 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 01:15:30,797 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 -> b3da85103e65fd13a584e838d8b961878044a0a70e09ad1788e3ca53a404f357 [2023-02-16 01:15:31,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 01:15:31,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 01:15:31,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 01:15:31,032 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 01:15:31,032 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 01:15:31,033 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/invert_string-1.c [2023-02-16 01:15:32,116 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 01:15:32,283 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 01:15:32,283 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/invert_string-1.c [2023-02-16 01:15:32,287 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/432b296a9/c8709809088a45a8be8561ab3630b7da/FLAG695bcdfd3 [2023-02-16 01:15:32,296 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/432b296a9/c8709809088a45a8be8561ab3630b7da [2023-02-16 01:15:32,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 01:15:32,299 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 01:15:32,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 01:15:32,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 01:15:32,302 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 01:15:32,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:15:32" (1/1) ... [2023-02-16 01:15:32,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a82d2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:15:32, skipping insertion in model container [2023-02-16 01:15:32,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:15:32" (1/1) ... [2023-02-16 01:15:32,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 01:15:32,319 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 01:15:32,405 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/loops/invert_string-1.c[352,365] [2023-02-16 01:15:32,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 01:15:32,422 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 01:15:32,429 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/loops/invert_string-1.c[352,365] [2023-02-16 01:15:32,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 01:15:32,444 INFO L208 MainTranslator]: Completed translation [2023-02-16 01:15:32,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:15:32 WrapperNode [2023-02-16 01:15:32,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 01:15:32,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 01:15:32,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 01:15:32,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 01:15:32,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:15:32" (1/1) ... [2023-02-16 01:15:32,456 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:15:32" (1/1) ... [2023-02-16 01:15:32,467 INFO L138 Inliner]: procedures = 15, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2023-02-16 01:15:32,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 01:15:32,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 01:15:32,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 01:15:32,469 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 01:15:32,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:15:32" (1/1) ... [2023-02-16 01:15:32,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:15:32" (1/1) ... [2023-02-16 01:15:32,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:15:32" (1/1) ... [2023-02-16 01:15:32,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:15:32" (1/1) ... [2023-02-16 01:15:32,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:15:32" (1/1) ... [2023-02-16 01:15:32,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:15:32" (1/1) ... [2023-02-16 01:15:32,482 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:15:32" (1/1) ... [2023-02-16 01:15:32,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:15:32" (1/1) ... [2023-02-16 01:15:32,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 01:15:32,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 01:15:32,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 01:15:32,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 01:15:32,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:15:32" (1/1) ... [2023-02-16 01:15:32,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 01:15:32,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:15:32,524 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-16 01:15:32,527 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-16 01:15:32,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 01:15:32,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 01:15:32,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 01:15:32,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 01:15:32,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 01:15:32,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 01:15:32,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 01:15:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 01:15:32,619 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 01:15:32,621 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 01:15:32,736 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 01:15:32,740 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 01:15:32,741 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-16 01:15:32,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:15:32 BoogieIcfgContainer [2023-02-16 01:15:32,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 01:15:32,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 01:15:32,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 01:15:32,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 01:15:32,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 01:15:32" (1/3) ... [2023-02-16 01:15:32,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@327d63e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:15:32, skipping insertion in model container [2023-02-16 01:15:32,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:15:32" (2/3) ... [2023-02-16 01:15:32,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@327d63e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:15:32, skipping insertion in model container [2023-02-16 01:15:32,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:15:32" (3/3) ... [2023-02-16 01:15:32,748 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string-1.c [2023-02-16 01:15:32,760 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 01:15:32,760 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 01:15:32,791 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 01:15:32,796 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;@571f7e5a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 01:15:32,800 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 01:15:32,811 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 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-16 01:15:32,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 01:15:32,816 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:15:32,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:15:32,817 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:15:32,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:15:32,821 INFO L85 PathProgramCache]: Analyzing trace with hash -56209308, now seen corresponding path program 1 times [2023-02-16 01:15:32,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:15:32,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459059954] [2023-02-16 01:15:32,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:15:32,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:15:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:15:32,941 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-16 01:15:32,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:15:32,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459059954] [2023-02-16 01:15:32,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459059954] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:15:32,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:15:32,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 01:15:32,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90314072] [2023-02-16 01:15:32,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:15:32,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 01:15:32,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:15:32,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 01:15:32,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 01:15:32,969 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:15:32,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:15:32,979 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2023-02-16 01:15:32,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 01:15:32,980 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-16 01:15:32,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:15:32,985 INFO L225 Difference]: With dead ends: 37 [2023-02-16 01:15:32,985 INFO L226 Difference]: Without dead ends: 16 [2023-02-16 01:15:32,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 01:15:32,990 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:15:32,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:15:33,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-02-16 01:15:33,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-02-16 01:15:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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-16 01:15:33,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2023-02-16 01:15:33,011 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2023-02-16 01:15:33,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:15:33,011 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2023-02-16 01:15:33,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:15:33,012 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2023-02-16 01:15:33,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 01:15:33,012 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:15:33,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:15:33,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 01:15:33,013 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:15:33,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:15:33,013 INFO L85 PathProgramCache]: Analyzing trace with hash -411746854, now seen corresponding path program 1 times [2023-02-16 01:15:33,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:15:33,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475361928] [2023-02-16 01:15:33,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:15:33,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:15:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:15:33,183 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-16 01:15:33,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:15:33,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475361928] [2023-02-16 01:15:33,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475361928] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:15:33,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:15:33,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 01:15:33,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387374369] [2023-02-16 01:15:33,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:15:33,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 01:15:33,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:15:33,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 01:15:33,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 01:15:33,186 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:15:33,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:15:33,214 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2023-02-16 01:15:33,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 01:15:33,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-16 01:15:33,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:15:33,215 INFO L225 Difference]: With dead ends: 34 [2023-02-16 01:15:33,215 INFO L226 Difference]: Without dead ends: 24 [2023-02-16 01:15:33,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 01:15:33,216 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:15:33,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 16 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:15:33,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-02-16 01:15:33,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2023-02-16 01:15:33,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:15:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2023-02-16 01:15:33,221 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2023-02-16 01:15:33,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:15:33,221 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2023-02-16 01:15:33,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:15:33,221 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2023-02-16 01:15:33,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 01:15:33,222 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:15:33,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:15:33,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 01:15:33,222 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:15:33,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:15:33,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1790951096, now seen corresponding path program 1 times [2023-02-16 01:15:33,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:15:33,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519256117] [2023-02-16 01:15:33,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:15:33,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:15:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:15:33,334 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-16 01:15:33,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:15:33,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519256117] [2023-02-16 01:15:33,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519256117] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:15:33,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:15:33,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 01:15:33,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387440940] [2023-02-16 01:15:33,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:15:33,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 01:15:33,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:15:33,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 01:15:33,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 01:15:33,338 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-16 01:15:33,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:15:33,367 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2023-02-16 01:15:33,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 01:15:33,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-16 01:15:33,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:15:33,368 INFO L225 Difference]: With dead ends: 25 [2023-02-16 01:15:33,368 INFO L226 Difference]: Without dead ends: 18 [2023-02-16 01:15:33,369 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-16 01:15:33,369 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:15:33,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 11 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:15:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-16 01:15:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-16 01:15:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 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-16 01:15:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2023-02-16 01:15:33,373 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2023-02-16 01:15:33,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:15:33,373 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2023-02-16 01:15:33,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-16 01:15:33,374 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2023-02-16 01:15:33,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-16 01:15:33,374 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:15:33,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:15:33,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 01:15:33,375 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:15:33,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:15:33,375 INFO L85 PathProgramCache]: Analyzing trace with hash 467501014, now seen corresponding path program 1 times [2023-02-16 01:15:33,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:15:33,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921835803] [2023-02-16 01:15:33,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:15:33,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:15:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:15:33,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:15:33,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:15:33,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921835803] [2023-02-16 01:15:33,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921835803] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:15:33,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633114594] [2023-02-16 01:15:33,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:15:33,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:15:33,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:15:33,819 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-16 01:15:33,820 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-16 01:15:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:15:33,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-16 01:15:33,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:15:33,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-16 01:15:33,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2023-02-16 01:15:34,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2023-02-16 01:15:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:15:34,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:15:34,080 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:15:34,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2023-02-16 01:15:34,093 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2023-02-16 01:15:34,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2023-02-16 01:15:34,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2023-02-16 01:15:34,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-16 01:15:34,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:15:34,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633114594] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:15:34,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:15:34,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2023-02-16 01:15:34,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76451622] [2023-02-16 01:15:34,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:15:34,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-16 01:15:34,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:15:34,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-16 01:15:34,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2023-02-16 01:15:34,248 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 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-16 01:15:34,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:15:34,757 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2023-02-16 01:15:34,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-16 01:15:34,758 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 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) Word has length 15 [2023-02-16 01:15:34,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:15:34,759 INFO L225 Difference]: With dead ends: 46 [2023-02-16 01:15:34,759 INFO L226 Difference]: Without dead ends: 29 [2023-02-16 01:15:34,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=789, Unknown=0, NotChecked=0, Total=1056 [2023-02-16 01:15:34,760 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 90 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 01:15:34,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 41 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 01:15:34,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-16 01:15:34,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2023-02-16 01:15:34,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:15:34,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2023-02-16 01:15:34,763 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 15 [2023-02-16 01:15:34,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:15:34,763 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2023-02-16 01:15:34,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 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-16 01:15:34,763 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2023-02-16 01:15:34,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 01:15:34,764 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:15:34,764 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:15:34,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-16 01:15:34,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:15:34,973 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:15:34,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:15:34,974 INFO L85 PathProgramCache]: Analyzing trace with hash 35676596, now seen corresponding path program 2 times [2023-02-16 01:15:34,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:15:34,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250216139] [2023-02-16 01:15:34,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:15:34,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:15:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:15:35,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:15:35,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:15:35,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250216139] [2023-02-16 01:15:35,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250216139] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:15:35,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119737023] [2023-02-16 01:15:35,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 01:15:35,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:15:35,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:15:35,043 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-16 01:15:35,077 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-16 01:15:35,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 01:15:35,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:15:35,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 01:15:35,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:15:35,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:15:35,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:15:35,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:15:35,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119737023] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:15:35,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:15:35,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2023-02-16 01:15:35,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937800097] [2023-02-16 01:15:35,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:15:35,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 01:15:35,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:15:35,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 01:15:35,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 01:15:35,152 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-16 01:15:35,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:15:35,193 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2023-02-16 01:15:35,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 01:15:35,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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 17 [2023-02-16 01:15:35,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:15:35,194 INFO L225 Difference]: With dead ends: 35 [2023-02-16 01:15:35,194 INFO L226 Difference]: Without dead ends: 28 [2023-02-16 01:15:35,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-16 01:15:35,195 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 44 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:15:35,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 24 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:15:35,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-16 01:15:35,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2023-02-16 01:15:35,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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-16 01:15:35,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-02-16 01:15:35,199 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2023-02-16 01:15:35,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:15:35,199 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-02-16 01:15:35,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-16 01:15:35,200 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-02-16 01:15:35,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 01:15:35,200 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:15:35,200 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:15:35,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-16 01:15:35,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:15:35,405 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:15:35,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:15:35,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1570853842, now seen corresponding path program 3 times [2023-02-16 01:15:35,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:15:35,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84272501] [2023-02-16 01:15:35,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:15:35,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:15:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:15:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:15:35,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:15:35,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84272501] [2023-02-16 01:15:35,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84272501] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:15:35,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144948045] [2023-02-16 01:15:35,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 01:15:35,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:15:35,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:15:35,736 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-16 01:15:35,739 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-16 01:15:35,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-16 01:15:35,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:15:35,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-16 01:15:35,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:15:35,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-16 01:15:35,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-02-16 01:15:35,987 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 01:15:35,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 23 [2023-02-16 01:15:35,998 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:15:35,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:15:36,029 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:15:36,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2023-02-16 01:15:36,040 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2023-02-16 01:15:36,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2023-02-16 01:15:36,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2023-02-16 01:15:36,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:15:36,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144948045] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:15:36,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:15:36,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2023-02-16 01:15:36,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524291067] [2023-02-16 01:15:36,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:15:36,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-16 01:15:36,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:15:36,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-16 01:15:36,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2023-02-16 01:15:36,165 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 31 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 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-16 01:15:36,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:15:36,902 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2023-02-16 01:15:36,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-16 01:15:36,902 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 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 19 [2023-02-16 01:15:36,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:15:36,903 INFO L225 Difference]: With dead ends: 64 [2023-02-16 01:15:36,903 INFO L226 Difference]: Without dead ends: 62 [2023-02-16 01:15:36,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=556, Invalid=2636, Unknown=0, NotChecked=0, Total=3192 [2023-02-16 01:15:36,905 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 01:15:36,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 107 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 01:15:36,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-02-16 01:15:36,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 33. [2023-02-16 01:15:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 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-16 01:15:36,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2023-02-16 01:15:36,921 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 19 [2023-02-16 01:15:36,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:15:36,923 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2023-02-16 01:15:36,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 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-16 01:15:36,923 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2023-02-16 01:15:36,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 01:15:36,924 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:15:36,924 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:15:36,943 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-16 01:15:37,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:15:37,131 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:15:37,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:15:37,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1044113744, now seen corresponding path program 4 times [2023-02-16 01:15:37,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:15:37,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006903156] [2023-02-16 01:15:37,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:15:37,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:15:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:15:37,199 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:15:37,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:15:37,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006903156] [2023-02-16 01:15:37,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006903156] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:15:37,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539950061] [2023-02-16 01:15:37,203 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 01:15:37,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:15:37,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:15:37,219 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 01:15:37,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 01:15:37,264 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 01:15:37,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:15:37,266 WARN L261 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-16 01:15:37,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:15:37,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 01:15:37,316 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-16 01:15:37,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-02-16 01:15:37,407 INFO L321 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2023-02-16 01:15:37,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 23 [2023-02-16 01:15:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 01:15:37,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:15:37,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 108 [2023-02-16 01:15:37,618 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:15:37,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 148 [2023-02-16 01:15:37,982 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 01:15:37,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539950061] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:15:37,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:15:37,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 23 [2023-02-16 01:15:37,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126916852] [2023-02-16 01:15:37,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:15:37,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-16 01:15:37,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:15:37,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-16 01:15:37,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2023-02-16 01:15:37,987 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:15:40,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 01:15:42,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 01:15:44,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 01:15:59,697 WARN L233 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 34 DAG size of output: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 01:16:09,925 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 37 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 01:16:22,393 WARN L233 SmtUtils]: Spent 12.45s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 01:16:34,969 WARN L233 SmtUtils]: Spent 10.06s on a formula simplification. DAG size of input: 36 DAG size of output: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 01:16:37,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 01:16:39,025 WARN L837 $PredicateComparison]: unable to prove that (and (or (< 0 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|ULTIMATE.start_main_~#str2~0#1.offset| Int) (|ULTIMATE.start_main_~#str1~0#1.base| Int) (|ULTIMATE.start_main_~#str1~0#1.offset| Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#str2~0#1.base|) (+ |c_ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~#str2~0#1.offset|) (select (select |c_#memory_int| |ULTIMATE.start_main_~#str1~0#1.base|) |ULTIMATE.start_main_~#str1~0#1.offset|)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#str2~0#1.base| .cse0) |ULTIMATE.start_main_~#str1~0#1.base|) |ULTIMATE.start_main_~#str1~0#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_main_~MAX~0#1| |ULTIMATE.start_main_~#str2~0#1.offset| (- 1)))))) (not (<= 0 |c_ULTIMATE.start_main_~i~0#1|))) (= |c_ULTIMATE.start_main_~i~0#1| 0)) is different from false [2023-02-16 01:16:41,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 01:16:57,450 WARN L233 SmtUtils]: Spent 12.07s on a formula simplification. DAG size of input: 39 DAG size of output: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 01:17:04,554 WARN L233 SmtUtils]: Spent 7.09s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 01:17:06,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 01:17:08,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 01:17:41,234 WARN L233 SmtUtils]: Spent 14.10s on a formula simplification. DAG size of input: 30 DAG size of output: 26 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 01:17:43,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 01:17:45,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 01:17:49,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 01:17:51,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 01:17:53,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 01:17:55,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 01:17:58,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 01:18:00,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 01:18:02,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 01:18:04,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 01:18:46,313 WARN L233 SmtUtils]: Spent 18.34s on a formula simplification. DAG size of input: 33 DAG size of output: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 01:18:48,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 01:18:51,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 01:18:53,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 01:18:55,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:18:55,608 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2023-02-16 01:18:55,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-02-16 01:18:55,608 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-16 01:18:55,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:18:55,609 INFO L225 Difference]: With dead ends: 107 [2023-02-16 01:18:55,609 INFO L226 Difference]: Without dead ends: 97 [2023-02-16 01:18:55,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 154.8s TimeCoverageRelationStatistics Valid=758, Invalid=4054, Unknown=22, NotChecked=136, Total=4970 [2023-02-16 01:18:55,611 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 155 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 42 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 43.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:18:55,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 147 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 546 Invalid, 20 Unknown, 1 Unchecked, 43.0s Time] [2023-02-16 01:18:55,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-02-16 01:18:55,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 46. [2023-02-16 01:18:55,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 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-16 01:18:55,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2023-02-16 01:18:55,621 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 21 [2023-02-16 01:18:55,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:18:55,622 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2023-02-16 01:18:55,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:18:55,622 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2023-02-16 01:18:55,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 01:18:55,622 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:18:55,623 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:18:55,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-16 01:18:55,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:18:55,828 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:18:55,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:18:55,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1262940008, now seen corresponding path program 1 times [2023-02-16 01:18:55,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:18:55,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479908928] [2023-02-16 01:18:55,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:18:55,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:18:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 01:18:55,858 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 01:18:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 01:18:55,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 01:18:55,902 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 01:18:55,903 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-16 01:18:55,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-16 01:18:55,907 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2023-02-16 01:18:55,909 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 01:18:55,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 01:18:55 BoogieIcfgContainer [2023-02-16 01:18:55,951 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 01:18:55,951 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 01:18:55,951 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 01:18:55,951 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 01:18:55,952 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:15:32" (3/4) ... [2023-02-16 01:18:55,953 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-16 01:18:56,012 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 01:18:56,013 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 01:18:56,013 INFO L158 Benchmark]: Toolchain (without parser) took 203713.95ms. Allocated memory was 151.0MB in the beginning and 249.6MB in the end (delta: 98.6MB). Free memory was 121.0MB in the beginning and 99.6MB in the end (delta: 21.4MB). Peak memory consumption was 120.7MB. Max. memory is 16.1GB. [2023-02-16 01:18:56,013 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 115.3MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 01:18:56,014 INFO L158 Benchmark]: CACSL2BoogieTranslator took 144.81ms. Allocated memory is still 151.0MB. Free memory was 121.0MB in the beginning and 110.4MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-16 01:18:56,014 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.32ms. Allocated memory is still 151.0MB. Free memory was 110.4MB in the beginning and 108.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 01:18:56,014 INFO L158 Benchmark]: Boogie Preprocessor took 15.28ms. Allocated memory is still 151.0MB. Free memory was 108.8MB in the beginning and 107.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 01:18:56,017 INFO L158 Benchmark]: RCFGBuilder took 258.15ms. Allocated memory is still 151.0MB. Free memory was 107.3MB in the beginning and 96.2MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-16 01:18:56,017 INFO L158 Benchmark]: TraceAbstraction took 203207.11ms. Allocated memory was 151.0MB in the beginning and 249.6MB in the end (delta: 98.6MB). Free memory was 95.8MB in the beginning and 102.7MB in the end (delta: -6.9MB). Peak memory consumption was 93.5MB. Max. memory is 16.1GB. [2023-02-16 01:18:56,017 INFO L158 Benchmark]: Witness Printer took 61.81ms. Allocated memory is still 249.6MB. Free memory was 102.7MB in the beginning and 99.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 01:18:56,018 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.14ms. Allocated memory is still 115.3MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 144.81ms. Allocated memory is still 151.0MB. Free memory was 121.0MB in the beginning and 110.4MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.32ms. Allocated memory is still 151.0MB. Free memory was 110.4MB in the beginning and 108.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.28ms. Allocated memory is still 151.0MB. Free memory was 108.8MB in the beginning and 107.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 258.15ms. Allocated memory is still 151.0MB. Free memory was 107.3MB in the beginning and 96.2MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 203207.11ms. Allocated memory was 151.0MB in the beginning and 249.6MB in the end (delta: 98.6MB). Free memory was 95.8MB in the beginning and 102.7MB in the end (delta: -6.9MB). Peak memory consumption was 93.5MB. Max. memory is 16.1GB. * Witness Printer took 61.81ms. Allocated memory is still 249.6MB. Free memory was 102.7MB in the beginning and 99.6MB 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 - CounterExampleResult [Line: 8]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int MAX = __VERIFIER_nondet_uint(); [L17] COND FALSE !(!(MAX > 0)) VAL [MAX=2] [L18] char str1[MAX], str2[MAX]; [L19] int cont, i, j; [L20] cont = 0 [L22] i=0 VAL [cont=0, i=0, MAX=2, str1={4:0}, str2={5:0}] [L22] COND TRUE i= 0 [L30] EXPR str1[0] [L30] str2[j] = str1[0] [L31] j++ VAL [cont=0, i=1, j=1, MAX=2, str1={4:0}, str2={5:0}] [L29] i-- VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5:0}] [L29] COND TRUE i >= 0 [L30] EXPR str1[0] [L30] str2[j] = str1[0] [L31] j++ VAL [cont=0, i=0, j=2, MAX=2, str1={4:0}, str2={5:0}] [L29] i-- VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L29] COND FALSE !(i >= 0) VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L34] j = MAX-1 [L35] i=0 VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5:0}] [L35] COND TRUE i